4,901,466

2 × 3 × 816911

4,901,466 factors as 2 × 3 × 816911. Its 8 positive divisors give a proper-divisor sum of 4,901,478, so this integer is abundant. The Collatz stopping time is 206 steps.

Prime Factor Structure

Factorization String 2 × 3 × 816911

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,802,944

Proper Divisor Sum 4,901,478

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4901453 ← → #4901471

Radix Representation

Decimal	4901466
Binary	10010101100101001011010 (23 bits)
Octal	0o22545132
Hexadecimal	0x4ACA5A

Divisor Catalog (8)

1 2 3 6 816,911 1,633,822 2,450,733 4,901,466

Collatz Trajectory (206 steps to reach 1)

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

4,901,466 2,450,733 7,352,200 3,676,100 1,838,050 919,025 2,757,076 1,378,538 689,269 2,067,808 1,033,904 516,952 258,476 129,238 64,619 193,858 96,929 290,788 145,394 72,697 218,092 109,046 54,523 163,570 81,785 245,356 122,678 61,339 184,018 92,009 276,028 138,014 69,007 207,022 103,511 310,534 155,267 465,802 232,901 698,704 349,352 174,676 87,338 43,669 131,008 65,504 32,752 16,376 8,188 4,094 2,047 6,142 3,071 9,214 4,607 13,822 6,911 20,734 10,367 31,102

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,901,465 Browse Full Index Next Integer #4,901,467 →