4,891,842

2 × 3² × 271769

4,891,842 factors as 2 × 3^2 × 271769. Its 12 positive divisors give a proper-divisor sum of 5,707,188, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 271769

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,599,030

Proper Divisor Sum 5,707,188

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4891841 ← → #4891853

Radix Representation

Decimal	4891842
Binary	10010101010010011000010 (23 bits)
Octal	0o22522302
Hexadecimal	0x4AA4C2

Divisor Catalog (12)

1 2 3 6 9 18 271,769 543,538 815,307 1,630,614 2,445,921 4,891,842

Collatz Trajectory (61 steps to reach 1)

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

4,891,842 2,445,921 7,337,764 3,668,882 1,834,441 5,503,324 2,751,662 1,375,831 4,127,494 2,063,747 6,191,242 3,095,621 9,286,864 4,643,432 2,321,716 1,160,858 580,429 1,741,288 870,644 435,322 217,661 652,984 326,492 163,246 81,623 244,870 122,435 367,306 183,653 550,960 275,480 137,740 68,870 34,435 103,306 51,653 154,960 77,480 38,740 19,370 9,685 29,056 14,528 7,264 3,632 1,816 908 454 227 682 341 1,024 512 256 128 64 32 16 8 4

← Previous Integer #4,891,841 Browse Full Index Next Integer #4,891,843 →