8,468,826

2 × 3 × 1411471

8,468,826 factors as 2 × 3 × 1411471. Its 8 positive divisors give a proper-divisor sum of 8,468,838, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1411471

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 16,937,664

Proper Divisor Sum 8,468,838

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #8468821 ← → #8468849

Radix Representation

Decimal	8468826
Binary	100000010011100101011010 (24 bits)
Octal	0o40234532
Hexadecimal	0x81395A

Divisor Catalog (8)

1 2 3 6 1,411,471 2,822,942 4,234,413 8,468,826

Collatz Trajectory (150 steps to reach 1)

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

8,468,826 4,234,413 12,703,240 6,351,620 3,175,810 1,587,905 4,763,716 2,381,858 1,190,929 3,572,788 1,786,394 893,197 2,679,592 1,339,796 669,898 334,949 1,004,848 502,424 251,212 125,606 62,803 188,410 94,205 282,616 141,308 70,654 35,327 105,982 52,991 158,974 79,487 238,462 119,231 357,694 178,847 536,542 268,271 804,814 402,407 1,207,222 603,611 1,810,834 905,417 2,716,252 1,358,126 679,063 2,037,190 1,018,595 3,055,786 1,527,893 4,583,680 2,291,840 1,145,920 572,960 286,480 143,240 71,620 35,810 17,905 53,716

← Previous Integer #8,468,825 Browse Full Index Next Integer #8,468,827 →