8,068,428

2² × 3² × 79 × 2837

8,068,428 factors as 2^2 × 3^2 × 79 × 2837. Its 36 positive divisors give a proper-divisor sum of 12,592,212, so this integer is abundant. The Collatz stopping time is 186 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 79 × 2837

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 20,660,640

Proper Divisor Sum 12,592,212

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #8068399 ← → #8068433

Radix Representation

Decimal	8068428
Binary	11110110001110101001100 (23 bits)
Octal	0o36616514
Hexadecimal	0x7B1D4C

Divisor Catalog (36)

1 2 3 4 6 9 12 18 36 79 158 237 316 474 711 948 1,422 2,837 2,844 5,674 8,511 11,348 17,022 25,533 34,044 51,066 102,132 224,123 448,246 672,369 896,492 1,344,738 2,017,107 2,689,476 4,034,214 8,068,428

Collatz Trajectory (186 steps to reach 1)

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

8,068,428 4,034,214 2,017,107 6,051,322 3,025,661 9,076,984 4,538,492 2,269,246 1,134,623 3,403,870 1,701,935 5,105,806 2,552,903 7,658,710 3,829,355 11,488,066 5,744,033 17,232,100 8,616,050 4,308,025 12,924,076 6,462,038 3,231,019 9,693,058 4,846,529 14,539,588 7,269,794 3,634,897 10,904,692 5,452,346 2,726,173 8,178,520 4,089,260 2,044,630 1,022,315 3,066,946 1,533,473 4,600,420 2,300,210 1,150,105 3,450,316 1,725,158 862,579 2,587,738 1,293,869 3,881,608 1,940,804 970,402 485,201 1,455,604 727,802 363,901 1,091,704 545,852 272,926 136,463 409,390 204,695 614,086 307,043

← Previous Integer #8,068,427 Browse Full Index Next Integer #8,068,429 →