8,066,046

2 × 3 × 47 × 28603

8,066,046 factors as 2 × 3 × 47 × 28603. Its 16 positive divisors give a proper-divisor sum of 8,409,858, so this integer is abundant. The Collatz stopping time is 186 steps.

Prime Factor Structure

Factorization String 2 × 3 × 47 × 28603

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 16,475,904

Proper Divisor Sum 8,409,858

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #8066039 ← → #8066057

Radix Representation

Decimal	8066046
Binary	11110110001001111111110 (23 bits)
Octal	0o36611776
Hexadecimal	0x7B13FE

Divisor Catalog (16)

1 2 3 6 47 94 141 282 28,603 57,206 85,809 171,618 1,344,341 2,688,682 4,033,023 8,066,046

Collatz Trajectory (186 steps to reach 1)

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

8,066,046 4,033,023 12,099,070 6,049,535 18,148,606 9,074,303 27,222,910 13,611,455 40,834,366 20,417,183 61,251,550 30,625,775 91,877,326 45,938,663 137,815,990 68,907,995 206,723,986 103,361,993 310,085,980 155,042,990 77,521,495 232,564,486 116,282,243 348,846,730 174,423,365 523,270,096 261,635,048 130,817,524 65,408,762 32,704,381 98,113,144 49,056,572 24,528,286 12,264,143 36,792,430 18,396,215 55,188,646 27,594,323 82,782,970 41,391,485 124,174,456 62,087,228 31,043,614 15,521,807 46,565,422 23,282,711 69,848,134 34,924,067 104,772,202 52,386,101 157,158,304 78,579,152 39,289,576 19,644,788 9,822,394 4,911,197 14,733,592 7,366,796 3,683,398 1,841,699

← Previous Integer #8,066,045 Browse Full Index Next Integer #8,066,047 →