8,184,670

2 × 5 × 13² × 29 × 167

8,184,670 factors as 2 × 5 × 13^2 × 29 × 167. Its 48 positive divisors give a proper-divisor sum of 8,417,090, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2 × 5 × 13^2 × 29 × 167

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 16,601,760

Proper Divisor Sum 8,417,090

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #8184647 ← → #8184691

Radix Representation

Decimal	8184670
Binary	11111001110001101011110 (23 bits)
Octal	0o37161536
Hexadecimal	0x7CE35E

Divisor Catalog (48)

1 2 5 10 13 26 29 58 65 130 145 167 169 290 334 338 377 754 835 845 1,670 1,690 1,885 2,171 3,770 4,342 4,843 4,901 9,686 9,802 10,855 21,710 24,215 24,505 28,223 48,430 49,010 56,446 62,959 125,918 141,115 282,230 314,795 629,590 818,467 1,636,934 4,092,335 8,184,670

Collatz Trajectory (168 steps to reach 1)

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

8,184,670 4,092,335 12,277,006 6,138,503 18,415,510 9,207,755 27,623,266 13,811,633 41,434,900 20,717,450 10,358,725 31,076,176 15,538,088 7,769,044 3,884,522 1,942,261 5,826,784 2,913,392 1,456,696 728,348 364,174 182,087 546,262 273,131 819,394 409,697 1,229,092 614,546 307,273 921,820 460,910 230,455 691,366 345,683 1,037,050 518,525 1,555,576 777,788 388,894 194,447 583,342 291,671 875,014 437,507 1,312,522 656,261 1,968,784 984,392 492,196 246,098 123,049 369,148 184,574 92,287 276,862 138,431 415,294 207,647 622,942 311,471

← Previous Integer #8,184,669 Browse Full Index Next Integer #8,184,671 →