5,174,784

2⁹ × 3² × 1123

5,174,784 factors as 2^9 × 3^2 × 1123. Its 60 positive divisors give a proper-divisor sum of 9,773,292, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^9 × 3^2 × 1123

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 60

Divisor Sum (σ) 14,948,076

Proper Divisor Sum 9,773,292

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5174777 ← → #5174791

Radix Representation

Decimal	5174784
Binary	10011101111011000000000 (23 bits)
Octal	0o23573000
Hexadecimal	0x4EF600

Divisor Catalog (60)

1 2 3 4 6 8 9 12 16 18 24 32 36 48 64 72 96 128 144 192 256 288 384 512 576 768 1,123 1,152 1,536 2,246 2,304 3,369 4,492 4,608 6,738 8,984 10,107 13,476 17,968 20,214 26,952 35,936 40,428 53,904 71,872 80,856 107,808 143,744 161,712 215,616 287,488 323,424 431,232 574,976 646,848 862,464 1,293,696 1,724,928 2,587,392 5,174,784

Collatz Trajectory (95 steps to reach 1)

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

5,174,784 2,587,392 1,293,696 646,848 323,424 161,712 80,856 40,428 20,214 10,107 30,322 15,161 45,484 22,742 11,371 34,114 17,057 51,172 25,586 12,793 38,380 19,190 9,595 28,786 14,393 43,180 21,590 10,795 32,386 16,193 48,580 24,290 12,145 36,436 18,218 9,109 27,328 13,664 6,832 3,416 1,708 854 427 1,282 641 1,924 962 481 1,444 722 361 1,084 542 271 814 407 1,222 611 1,834 917

← Previous Integer #5,174,783 Browse Full Index Next Integer #5,174,785 →