29,201,616

2⁴ × 3² × 149 × 1361

29,201,616 factors as 2^4 × 3^2 × 149 × 1361. Its 60 positive divisors give a proper-divisor sum of 53,131,284, so this integer is abundant. The Collatz stopping time is 237 steps.

Prime Factor Structure

Factorization String 2^4 × 3^2 × 149 × 1361

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 60

Divisor Sum (σ) 82,332,900

Proper Divisor Sum 53,131,284

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #29201611 ← → #29201647

Radix Representation

Decimal	29201616
Binary	1101111011001010011010000 (25 bits)
Octal	0o157312320
Hexadecimal	0x1BD94D0

Divisor Catalog (60)

1 2 3 4 6 8 9 12 16 18 24 36 48 72 144 149 298 447 596 894 1,192 1,341 1,361 1,788 2,384 2,682 2,722 3,576 4,083 5,364 5,444 7,152 8,166 10,728 10,888 12,249 16,332 21,456 21,776 24,498 32,664 48,996 65,328 97,992 195,984 202,789 405,578 608,367 811,156 1,216,734 1,622,312 1,825,101 2,433,468 3,244,624 3,650,202 4,866,936 7,300,404 9,733,872 14,600,808 29,201,616

Collatz Trajectory (237 steps to reach 1)

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

29,201,616 14,600,808 7,300,404 3,650,202 1,825,101 5,475,304 2,737,652 1,368,826 684,413 2,053,240 1,026,620 513,310 256,655 769,966 384,983 1,154,950 577,475 1,732,426 866,213 2,598,640 1,299,320 649,660 324,830 162,415 487,246 243,623 730,870 365,435 1,096,306 548,153 1,644,460 822,230 411,115 1,233,346 616,673 1,850,020 925,010 462,505 1,387,516 693,758 346,879 1,040,638 520,319 1,560,958 780,479 2,341,438 1,170,719 3,512,158 1,756,079 5,268,238 2,634,119 7,902,358 3,951,179 11,853,538 5,926,769 17,780,308 8,890,154 4,445,077 13,335,232 6,667,616

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #29,201,615 Browse Full Index Next Integer #29,201,617 →