2,269,120

2⁶ × 5 × 7 × 1013

2,269,120 factors as 2^6 × 5 × 7 × 1013. Its 56 positive divisors give a proper-divisor sum of 3,912,224, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2^6 × 5 × 7 × 1013

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 56

Divisor Sum (σ) 6,181,344

Proper Divisor Sum 3,912,224

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #2269103 ← → #2269129

Radix Representation

Decimal	2269120
Binary	1000101001111111000000 (22 bits)
Octal	0o10517700
Hexadecimal	0x229FC0

Divisor Catalog (56)

1 2 4 5 7 8 10 14 16 20 28 32 35 40 56 64 70 80 112 140 160 224 280 320 448 560 1,013 1,120 2,026 2,240 4,052 5,065 7,091 8,104 10,130 14,182 16,208 20,260 28,364 32,416 35,455 40,520 56,728 64,832 70,910 81,040 113,456 141,820 162,080 226,912 283,640 324,160 453,824 567,280 1,134,560 2,269,120

Collatz Trajectory (86 steps to reach 1)

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

2,269,120 1,134,560 567,280 283,640 141,820 70,910 35,455 106,366 53,183 159,550 79,775 239,326 119,663 358,990 179,495 538,486 269,243 807,730 403,865 1,211,596 605,798 302,899 908,698 454,349 1,363,048 681,524 340,762 170,381 511,144 255,572 127,786 63,893 191,680 95,840 47,920 23,960 11,980 5,990 2,995 8,986 4,493 13,480 6,740 3,370 1,685 5,056 2,528 1,264 632 316 158 79 238 119 358 179 538 269 808 404

← Previous Integer #2,269,119 Browse Full Index Next Integer #2,269,121 →