8,060,608

2⁶ × 29 × 43 × 101

8,060,608 factors as 2^6 × 29 × 43 × 101. Its 56 positive divisors give a proper-divisor sum of 9,038,672, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2^6 × 29 × 43 × 101

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 56

Divisor Sum (σ) 17,099,280

Proper Divisor Sum 9,038,672

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #8060599 ← → #8060609

Radix Representation

Decimal	8060608
Binary	11110101111111011000000 (23 bits)
Octal	0o36577300
Hexadecimal	0x7AFEC0

Divisor Catalog (56)

1 2 4 8 16 29 32 43 58 64 86 101 116 172 202 232 344 404 464 688 808 928 1,247 1,376 1,616 1,856 2,494 2,752 2,929 3,232 4,343 4,988 5,858 6,464 8,686 9,976 11,716 17,372 19,952 23,432 34,744 39,904 46,864 69,488 79,808 93,728 125,947 138,976 187,456 251,894 277,952 503,788 1,007,576 2,015,152 4,030,304 8,060,608

Collatz Trajectory (93 steps to reach 1)

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

8,060,608 4,030,304 2,015,152 1,007,576 503,788 251,894 125,947 377,842 188,921 566,764 283,382 141,691 425,074 212,537 637,612 318,806 159,403 478,210 239,105 717,316 358,658 179,329 537,988 268,994 134,497 403,492 201,746 100,873 302,620 151,310 75,655 226,966 113,483 340,450 170,225 510,676 255,338 127,669 383,008 191,504 95,752 47,876 23,938 11,969 35,908 17,954 8,977 26,932 13,466 6,733 20,200 10,100 5,050 2,525 7,576 3,788 1,894 947 2,842 1,421

← Previous Integer #8,060,607 Browse Full Index Next Integer #8,060,609 →