5,468,808

2³ × 3 × 19 × 67 × 179

5,468,808 factors as 2^3 × 3 × 19 × 67 × 179. Its 64 positive divisors give a proper-divisor sum of 9,219,192, so this integer is abundant. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 19 × 67 × 179

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 14,688,000

Proper Divisor Sum 9,219,192

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #5468807 ← → #5468809

Radix Representation

Decimal	5468808
Binary	10100110111001010001000 (23 bits)
Octal	0o24671210
Hexadecimal	0x537288

Divisor Catalog (60 of 64)

1 2 3 4 6 8 12 19 24 38 57 67 76 114 134 152 179 201 228 268 358 402 456 536 537 716 804 1,074 1,273 1,432 1,608 2,148 2,546 3,401 3,819 4,296 5,092 6,802 7,638 10,184 10,203 11,993 13,604 15,276 20,406 23,986 27,208 30,552 35,979 40,812 47,972 71,958 81,624 95,944 143,916 227,867 287,832 455,734 683,601 911,468

Collatz Trajectory (82 steps to reach 1)

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

5,468,808 2,734,404 1,367,202 683,601 2,050,804 1,025,402 512,701 1,538,104 769,052 384,526 192,263 576,790 288,395 865,186 432,593 1,297,780 648,890 324,445 973,336 486,668 243,334 121,667 365,002 182,501 547,504 273,752 136,876 68,438 34,219 102,658 51,329 153,988 76,994 38,497 115,492 57,746 28,873 86,620 43,310 21,655 64,966 32,483 97,450 48,725 146,176 73,088 36,544 18,272 9,136 4,568 2,284 1,142 571 1,714 857 2,572 1,286 643 1,930 965

← Previous Integer #5,468,807 Browse Full Index Next Integer #5,468,809 →