5,906,268

2² × 3² × 359 × 457

5,906,268 factors as 2^2 × 3^2 × 359 × 457. Its 36 positive divisors give a proper-divisor sum of 9,097,812, so this integer is abundant. The Collatz stopping time is 144 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 359 × 457

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 15,004,080

Proper Divisor Sum 9,097,812

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5906261 ← → #5906269

Radix Representation

Decimal	5906268
Binary	10110100001111101011100 (23 bits)
Octal	0o26417534
Hexadecimal	0x5A1F5C

Divisor Catalog (36)

1 2 3 4 6 9 12 18 36 359 457 718 914 1,077 1,371 1,436 1,828 2,154 2,742 3,231 4,113 4,308 5,484 6,462 8,226 12,924 16,452 164,063 328,126 492,189 656,252 984,378 1,476,567 1,968,756 2,953,134 5,906,268

Collatz Trajectory (144 steps to reach 1)

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

5,906,268 2,953,134 1,476,567 4,429,702 2,214,851 6,644,554 3,322,277 9,966,832 4,983,416 2,491,708 1,245,854 622,927 1,868,782 934,391 2,803,174 1,401,587 4,204,762 2,102,381 6,307,144 3,153,572 1,576,786 788,393 2,365,180 1,182,590 591,295 1,773,886 886,943 2,660,830 1,330,415 3,991,246 1,995,623 5,986,870 2,993,435 8,980,306 4,490,153 13,470,460 6,735,230 3,367,615 10,102,846 5,051,423 15,154,270 7,577,135 22,731,406 11,365,703 34,097,110 17,048,555 51,145,666 25,572,833 76,718,500 38,359,250 19,179,625 57,538,876 28,769,438 14,384,719 43,154,158 21,577,079 64,731,238 32,365,619 97,096,858 48,548,429

← Previous Integer #5,906,267 Browse Full Index Next Integer #5,906,269 →