5,136,016

2⁴ × 29 × 11069

5,136,016 factors as 2^4 × 29 × 11069. Its 20 positive divisors give a proper-divisor sum of 5,159,084, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2^4 × 29 × 11069

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 10,295,100

Proper Divisor Sum 5,159,084

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #5136013 ← → #5136031

Radix Representation

Decimal	5136016
Binary	10011100101111010010000 (23 bits)
Octal	0o23457220
Hexadecimal	0x4E5E90

Divisor Catalog (20)

Collatz Trajectory (100 steps to reach 1)

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

5,136,016 2,568,008 1,284,004 642,002 321,001 963,004 481,502 240,751 722,254 361,127 1,083,382 541,691 1,625,074 812,537 2,437,612 1,218,806 609,403 1,828,210 914,105 2,742,316 1,371,158 685,579 2,056,738 1,028,369 3,085,108 1,542,554 771,277 2,313,832 1,156,916 578,458 289,229 867,688 433,844 216,922 108,461 325,384 162,692 81,346 40,673 122,020 61,010 30,505 91,516 45,758 22,879 68,638 34,319 102,958 51,479 154,438 77,219 231,658 115,829 347,488 173,744 86,872 43,436 21,718 10,859 32,578

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,136,015 Browse Full Index Next Integer #5,136,017 →