11,639,690

2 × 5 × 1163969

11,639,690 factors as 2 × 5 × 1163969. Its 8 positive divisors give a proper-divisor sum of 9,311,770, so this integer is deficient. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2 × 5 × 1163969

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 20,951,460

Proper Divisor Sum 9,311,770

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #11639681 ← → #11639707

Radix Representation

Decimal	11639690
Binary	101100011001101110001010 (24 bits)
Octal	0o54315612
Hexadecimal	0xB19B8A

Divisor Catalog (8)

1 2 5 10 1,163,969 2,327,938 5,819,845 11,639,690

Collatz Trajectory (91 steps to reach 1)

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

11,639,690 5,819,845 17,459,536 8,729,768 4,364,884 2,182,442 1,091,221 3,273,664 1,636,832 818,416 409,208 204,604 102,302 51,151 153,454 76,727 230,182 115,091 345,274 172,637 517,912 258,956 129,478 64,739 194,218 97,109 291,328 145,664 72,832 36,416 18,208 9,104 4,552 2,276 1,138 569 1,708 854 427 1,282 641 1,924 962 481 1,444 722 361 1,084 542 271 814 407 1,222 611 1,834 917 2,752 1,376 688 344

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,639,689 Browse Full Index Next Integer #11,639,691 →