2,230,596

2² × 3² × 61961

2,230,596 factors as 2^2 × 3^2 × 61961. Its 18 positive divisors give a proper-divisor sum of 3,407,946, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 61961

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 5,638,542

Proper Divisor Sum 3,407,946

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2230589 ← → #2230597

Radix Representation

Decimal	2230596
Binary	1000100000100101000100 (22 bits)
Octal	0o10404504
Hexadecimal	0x220944

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 61,961 123,922 185,883 247,844 371,766 557,649 743,532 1,115,298 2,230,596

Collatz Trajectory (91 steps to reach 1)

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

2,230,596 1,115,298 557,649 1,672,948 836,474 418,237 1,254,712 627,356 313,678 156,839 470,518 235,259 705,778 352,889 1,058,668 529,334 264,667 794,002 397,001 1,191,004 595,502 297,751 893,254 446,627 1,339,882 669,941 2,009,824 1,004,912 502,456 251,228 125,614 62,807 188,422 94,211 282,634 141,317 423,952 211,976 105,988 52,994 26,497 79,492 39,746 19,873 59,620 29,810 14,905 44,716 22,358 11,179 33,538 16,769 50,308 25,154 12,577 37,732 18,866 9,433 28,300 14,150

← Previous Integer #2,230,595 Browse Full Index Next Integer #2,230,597 →