6,857,112

2³ × 3 × 47 × 6079

6,857,112 factors as 2^3 × 3 × 47 × 6079. Its 32 positive divisors give a proper-divisor sum of 10,653,288, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 47 × 6079

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 17,510,400

Proper Divisor Sum 10,653,288

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6857101 ← → #6857117

Radix Representation

Decimal	6857112
Binary	11010001010000110011000 (23 bits)
Octal	0o32120630
Hexadecimal	0x68A198

Divisor Catalog (32)

1 2 3 4 6 8 12 24 47 94 141 188 282 376 564 1,128 6,079 12,158 18,237 24,316 36,474 48,632 72,948 145,896 285,713 571,426 857,139 1,142,852 1,714,278 2,285,704 3,428,556 6,857,112

Collatz Trajectory (129 steps to reach 1)

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

6,857,112 3,428,556 1,714,278 857,139 2,571,418 1,285,709 3,857,128 1,928,564 964,282 482,141 1,446,424 723,212 361,606 180,803 542,410 271,205 813,616 406,808 203,404 101,702 50,851 152,554 76,277 228,832 114,416 57,208 28,604 14,302 7,151 21,454 10,727 32,182 16,091 48,274 24,137 72,412 36,206 18,103 54,310 27,155 81,466 40,733 122,200 61,100 30,550 15,275 45,826 22,913 68,740 34,370 17,185 51,556 25,778 12,889 38,668 19,334 9,667 29,002 14,501 43,504

← Previous Integer #6,857,111 Browse Full Index Next Integer #6,857,113 →