6,157,824

2⁹ × 3 × 19 × 211

6,157,824 factors as 2^9 × 3 × 19 × 211. Its 80 positive divisors give a proper-divisor sum of 11,192,256, so this integer is abundant. The Collatz stopping time is 152 steps.

Prime Factor Structure

Factorization String 2^9 × 3 × 19 × 211

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 17,350,080

Proper Divisor Sum 11,192,256

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6157819 ← → #6157841

Radix Representation

Decimal	6157824
Binary	10111011111011000000000 (23 bits)
Octal	0o27373000
Hexadecimal	0x5DF600

Divisor Catalog (60 of 80)

1 2 3 4 6 8 12 16 19 24 32 38 48 57 64 76 96 114 128 152 192 211 228 256 304 384 422 456 512 608 633 768 844 912 1,216 1,266 1,536 1,688 1,824 2,432 2,532 3,376 3,648 4,009 4,864 5,064 6,752 7,296 8,018 9,728 10,128 12,027 13,504 14,592 16,036 20,256 24,054 27,008 29,184 32,072

Collatz Trajectory (152 steps to reach 1)

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

6,157,824 3,078,912 1,539,456 769,728 384,864 192,432 96,216 48,108 24,054 12,027 36,082 18,041 54,124 27,062 13,531 40,594 20,297 60,892 30,446 15,223 45,670 22,835 68,506 34,253 102,760 51,380 25,690 12,845 38,536 19,268 9,634 4,817 14,452 7,226 3,613 10,840 5,420 2,710 1,355 4,066 2,033 6,100 3,050 1,525 4,576 2,288 1,144 572 286 143 430 215 646 323 970 485 1,456 728 364 182

← Previous Integer #6,157,823 Browse Full Index Next Integer #6,157,825 →