5,149,032

2³ × 3 × 7 × 30649

5,149,032 factors as 2^3 × 3 × 7 × 30649. Its 32 positive divisors give a proper-divisor sum of 9,562,968, so this integer is abundant. The Collatz stopping time is 219 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 7 × 30649

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 14,712,000

Proper Divisor Sum 9,562,968

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #5149021 ← → #5149049

Radix Representation

Decimal	5149032
Binary	10011101001000101101000 (23 bits)
Octal	0o23510550
Hexadecimal	0x4E9168

Divisor Catalog (32)

1 2 3 4 6 7 8 12 14 21 24 28 42 56 84 168 30,649 61,298 91,947 122,596 183,894 214,543 245,192 367,788 429,086 643,629 735,576 858,172 1,287,258 1,716,344 2,574,516 5,149,032

Collatz Trajectory (219 steps to reach 1)

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

5,149,032 2,574,516 1,287,258 643,629 1,930,888 965,444 482,722 241,361 724,084 362,042 181,021 543,064 271,532 135,766 67,883 203,650 101,825 305,476 152,738 76,369 229,108 114,554 57,277 171,832 85,916 42,958 21,479 64,438 32,219 96,658 48,329 144,988 72,494 36,247 108,742 54,371 163,114 81,557 244,672 122,336 61,168 30,584 15,292 7,646 3,823 11,470 5,735 17,206 8,603 25,810 12,905 38,716 19,358 9,679 29,038 14,519 43,558 21,779 65,338 32,669

← Previous Integer #5,149,031 Browse Full Index Next Integer #5,149,033 →