11,645,648

2⁴ × 7 × 103979

11,645,648 factors as 2^4 × 7 × 103979. Its 20 positive divisors give a proper-divisor sum of 14,141,392, so this integer is abundant. The Collatz stopping time is 78 steps.

Prime Factor Structure

Factorization String 2^4 × 7 × 103979

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 25,787,040

Proper Divisor Sum 14,141,392

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #11645611 ← → #11645671

Radix Representation

Decimal	11645648
Binary	101100011011001011010000 (24 bits)
Octal	0o54331320
Hexadecimal	0xB1B2D0

Divisor Catalog (20)

Collatz Trajectory (78 steps to reach 1)

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

11,645,648 5,822,824 2,911,412 1,455,706 727,853 2,183,560 1,091,780 545,890 272,945 818,836 409,418 204,709 614,128 307,064 153,532 76,766 38,383 115,150 57,575 172,726 86,363 259,090 129,545 388,636 194,318 97,159 291,478 145,739 437,218 218,609 655,828 327,914 163,957 491,872 245,936 122,968 61,484 30,742 15,371 46,114 23,057 69,172 34,586 17,293 51,880 25,940 12,970 6,485 19,456 9,728 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,645,647 Browse Full Index Next Integer #11,645,649 →