2,224,902

2 × 3 × 601 × 617

2,224,902 factors as 2 × 3 × 601 × 617. Its 16 positive divisors give a proper-divisor sum of 2,239,530, so this integer is abundant. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 2 × 3 × 601 × 617

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,464,432

Proper Divisor Sum 2,239,530

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2224897 ← → #2224907

Radix Representation

Decimal	2224902
Binary	1000011111001100000110 (22 bits)
Octal	0o10371406
Hexadecimal	0x21F306

Divisor Catalog (16)

1 2 3 6 601 617 1,202 1,234 1,803 1,851 3,606 3,702 370,817 741,634 1,112,451 2,224,902

Collatz Trajectory (135 steps to reach 1)

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

2,224,902 1,112,451 3,337,354 1,668,677 5,006,032 2,503,016 1,251,508 625,754 312,877 938,632 469,316 234,658 117,329 351,988 175,994 87,997 263,992 131,996 65,998 32,999 98,998 49,499 148,498 74,249 222,748 111,374 55,687 167,062 83,531 250,594 125,297 375,892 187,946 93,973 281,920 140,960 70,480 35,240 17,620 8,810 4,405 13,216 6,608 3,304 1,652 826 413 1,240 620 310 155 466 233 700 350 175 526 263 790 395

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,224,901 Browse Full Index Next Integer #2,224,903 →