1,169,712

2⁴ × 3² × 8123

1,169,712 factors as 2^4 × 3^2 × 8123. Its 30 positive divisors give a proper-divisor sum of 2,104,260, so this integer is abundant. The Collatz stopping time is 67 steps.

Prime Factor Structure

Factorization String 2^4 × 3^2 × 8123

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 30

Divisor Sum (σ) 3,273,972

Proper Divisor Sum 2,104,260

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1169687 ← → #1169713

Radix Representation

Decimal	1169712
Binary	100011101100100110000 (21 bits)
Octal	0o4354460
Hexadecimal	0x11D930

Divisor Catalog (30)

1 2 3 4 6 8 9 12 16 18 24 36 48 72 144 8,123 16,246 24,369 32,492 48,738 64,984 73,107 97,476 129,968 146,214 194,952 292,428 389,904 584,856 1,169,712

Collatz Trajectory (67 steps to reach 1)

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

1,169,712 584,856 292,428 146,214 73,107 219,322 109,661 328,984 164,492 82,246 41,123 123,370 61,685 185,056 92,528 46,264 23,132 11,566 5,783 17,350 8,675 26,026 13,013 39,040 19,520 9,760 4,880 2,440 1,220 610 305 916 458 229 688 344 172 86 43 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40

← Previous Integer #1,169,711 Browse Full Index Next Integer #1,169,713 →