5,909,556

2² × 3 × 492463

5,909,556 factors as 2^2 × 3 × 492463. Its 12 positive divisors give a proper-divisor sum of 7,879,436, so this integer is abundant. The Collatz stopping time is 64 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 492463

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,788,992

Proper Divisor Sum 7,879,436

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #5909549 ← → #5909567

Radix Representation

Decimal	5909556
Binary	10110100010110000110100 (23 bits)
Octal	0o26426064
Hexadecimal	0x5A2C34

Divisor Catalog (12)

1 2 3 4 6 12 492,463 984,926 1,477,389 1,969,852 2,954,778 5,909,556

Collatz Trajectory (64 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

5,909,556 2,954,778 1,477,389 4,432,168 2,216,084 1,108,042 554,021 1,662,064 831,032 415,516 207,758 103,879 311,638 155,819 467,458 233,729 701,188 350,594 175,297 525,892 262,946 131,473 394,420 197,210 98,605 295,816 147,908 73,954 36,977 110,932 55,466 27,733 83,200 41,600 20,800 10,400 5,200 2,600 1,300 650 325 976 488 244 122 61 184 92 46 23 70 35 106 53 160 80 40 20 10 5

← Previous Integer #5,909,555 Browse Full Index Next Integer #5,909,557 →