11,640,822

2 × 3 × 1940137

11,640,822 factors as 2 × 3 × 1940137. Its 8 positive divisors give a proper-divisor sum of 11,640,834, so this integer is abundant. The Collatz stopping time is 78 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1940137

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 23,281,656

Proper Divisor Sum 11,640,834

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #11640817 ← → #11640847

Radix Representation

Decimal	11640822
Binary	101100011001111111110110 (24 bits)
Octal	0o54317766
Hexadecimal	0xB19FF6

Divisor Catalog (8)

1 2 3 6 1,940,137 3,880,274 5,820,411 11,640,822

Collatz Trajectory (78 steps to reach 1)

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

11,640,822 5,820,411 17,461,234 8,730,617 26,191,852 13,095,926 6,547,963 19,643,890 9,821,945 29,465,836 14,732,918 7,366,459 22,099,378 11,049,689 33,149,068 16,574,534 8,287,267 24,861,802 12,430,901 37,292,704 18,646,352 9,323,176 4,661,588 2,330,794 1,165,397 3,496,192 1,748,096 874,048 437,024 218,512 109,256 54,628 27,314 13,657 40,972 20,486 10,243 30,730 15,365 46,096 23,048 11,524 5,762 2,881 8,644 4,322 2,161 6,484 3,242 1,621 4,864 2,432 1,216 608 304 152 76 38 19 58

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,640,821 Browse Full Index Next Integer #11,640,823 →