8,109,072

2⁴ × 3⁴ × 6257

8,109,072 factors as 2^4 × 3^4 × 6257. Its 50 positive divisors give a proper-divisor sum of 15,364,686, so this integer is abundant. The Collatz stopping time is 137 steps.

Prime Factor Structure

Factorization String 2^4 × 3^4 × 6257

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 50

Divisor Sum (σ) 23,473,758

Proper Divisor Sum 15,364,686

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #8109071 ← → #8109083

Radix Representation

Decimal	8109072
Binary	11110111011110000010000 (23 bits)
Octal	0o36736020
Hexadecimal	0x7BBC10

Divisor Catalog (50)

1 2 3 4 6 8 9 12 16 18 24 27 36 48 54 72 81 108 144 162 216 324 432 648 1,296 6,257 12,514 18,771 25,028 37,542 50,056 56,313 75,084 100,112 112,626 150,168 168,939 225,252 300,336 337,878 450,504 506,817 675,756 901,008 1,013,634 1,351,512 2,027,268 2,703,024 4,054,536 8,109,072

Collatz Trajectory (137 steps to reach 1)

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

8,109,072 4,054,536 2,027,268 1,013,634 506,817 1,520,452 760,226 380,113 1,140,340 570,170 285,085 855,256 427,628 213,814 106,907 320,722 160,361 481,084 240,542 120,271 360,814 180,407 541,222 270,611 811,834 405,917 1,217,752 608,876 304,438 152,219 456,658 228,329 684,988 342,494 171,247 513,742 256,871 770,614 385,307 1,155,922 577,961 1,733,884 866,942 433,471 1,300,414 650,207 1,950,622 975,311 2,925,934 1,462,967 4,388,902 2,194,451 6,583,354 3,291,677 9,875,032 4,937,516 2,468,758 1,234,379 3,703,138 1,851,569

← Previous Integer #8,109,071 Browse Full Index Next Integer #8,109,073 →