8,079,168

2⁶ × 3 × 29 × 1451

8,079,168 factors as 2^6 × 3 × 29 × 1451. Its 56 positive divisors give a proper-divisor sum of 14,049,312, so this integer is abundant. The Collatz stopping time is 230 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 29 × 1451

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 56

Divisor Sum (σ) 22,128,480

Proper Divisor Sum 14,049,312

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8079133 ← → #8079193

Radix Representation

Decimal	8079168
Binary	11110110100011101000000 (23 bits)
Octal	0o36643500
Hexadecimal	0x7B4740

Divisor Catalog (56)

1 2 3 4 6 8 12 16 24 29 32 48 58 64 87 96 116 174 192 232 348 464 696 928 1,392 1,451 1,856 2,784 2,902 4,353 5,568 5,804 8,706 11,608 17,412 23,216 34,824 42,079 46,432 69,648 84,158 92,864 126,237 139,296 168,316 252,474 278,592 336,632 504,948 673,264 1,009,896 1,346,528 2,019,792 2,693,056 4,039,584 8,079,168

Collatz Trajectory (230 steps to reach 1)

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

8,079,168 4,039,584 2,019,792 1,009,896 504,948 252,474 126,237 378,712 189,356 94,678 47,339 142,018 71,009 213,028 106,514 53,257 159,772 79,886 39,943 119,830 59,915 179,746 89,873 269,620 134,810 67,405 202,216 101,108 50,554 25,277 75,832 37,916 18,958 9,479 28,438 14,219 42,658 21,329 63,988 31,994 15,997 47,992 23,996 11,998 5,999 17,998 8,999 26,998 13,499 40,498 20,249 60,748 30,374 15,187 45,562 22,781 68,344 34,172 17,086 8,543

← Previous Integer #8,079,167 Browse Full Index Next Integer #8,079,169 →