4,217,796

2² × 3² × 11 × 10651

4,217,796 factors as 2^2 × 3^2 × 11 × 10651. Its 36 positive divisors give a proper-divisor sum of 7,414,188, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 11 × 10651

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 11,631,984

Proper Divisor Sum 7,414,188

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4217783 ← → #4217813

Radix Representation

Decimal	4217796
Binary	10000000101101111000100 (23 bits)
Octal	0o20055704
Hexadecimal	0x405BC4

Divisor Catalog (36)

1 2 3 4 6 9 11 12 18 22 33 36 44 66 99 132 198 396 10,651 21,302 31,953 42,604 63,906 95,859 117,161 127,812 191,718 234,322 351,483 383,436 468,644 702,966 1,054,449 1,405,932 2,108,898 4,217,796

Collatz Trajectory (105 steps to reach 1)

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

4,217,796 2,108,898 1,054,449 3,163,348 1,581,674 790,837 2,372,512 1,186,256 593,128 296,564 148,282 74,141 222,424 111,212 55,606 27,803 83,410 41,705 125,116 62,558 31,279 93,838 46,919 140,758 70,379 211,138 105,569 316,708 158,354 79,177 237,532 118,766 59,383 178,150 89,075 267,226 133,613 400,840 200,420 100,210 50,105 150,316 75,158 37,579 112,738 56,369 169,108 84,554 42,277 126,832 63,416 31,708 15,854 7,927 23,782 11,891 35,674 17,837 53,512 26,756

← Previous Integer #4,217,795 Browse Full Index Next Integer #4,217,797 →