5,145,608

2³ × 13 × 49477

5,145,608 factors as 2^3 × 13 × 49477. Its 16 positive divisors give a proper-divisor sum of 5,244,772, so this integer is abundant. The Collatz stopping time is 188 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 49477

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,390,380

Proper Divisor Sum 5,244,772

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #5145601 ← → #5145619

Radix Representation

Decimal	5145608
Binary	10011101000010000001000 (23 bits)
Octal	0o23502010
Hexadecimal	0x4E8408

Divisor Catalog (16)

1 2 4 8 13 26 52 104 49,477 98,954 197,908 395,816 643,201 1,286,402 2,572,804 5,145,608

Collatz Trajectory (188 steps to reach 1)

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

5,145,608 2,572,804 1,286,402 643,201 1,929,604 964,802 482,401 1,447,204 723,602 361,801 1,085,404 542,702 271,351 814,054 407,027 1,221,082 610,541 1,831,624 915,812 457,906 228,953 686,860 343,430 171,715 515,146 257,573 772,720 386,360 193,180 96,590 48,295 144,886 72,443 217,330 108,665 325,996 162,998 81,499 244,498 122,249 366,748 183,374 91,687 275,062 137,531 412,594 206,297 618,892 309,446 154,723 464,170 232,085 696,256 348,128 174,064 87,032 43,516 21,758 10,879 32,638

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,145,607 Browse Full Index Next Integer #5,145,609 →