Base | Representation |
---|---|
bin | 1001101001010111111011… |
… | …0000111110100000111000 |
3 | 1101112221222022201220202210 |
4 | 2122111332300332200320 |
5 | 2342233402130201013 |
6 | 34320302515255120 |
7 | 2143200335110131 |
oct | 232257660764070 |
9 | 41487868656683 |
10 | 10606401022008 |
11 | 341a170961150 |
12 | 12337122aa4a0 |
13 | 5bc243c902cc |
14 | 2894d1570c88 |
15 | 135d6bc0ecc3 |
hex | 9a57ec3e838 |
10606401022008 has 64 divisors (see below), whose sum is σ = 28926992344320. Its totient is φ = 3214011571200.
The previous prime is 10606401021991. The next prime is 10606401022057. The reversal of 10606401022008 is 80022010460601.
It is a Cunningham number, because it is equal to 32567472-1.
It is a super-2 number, since 2×106064010220082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19269093 + ... + 19811883.
It is an arithmetic number, because the mean of its divisors is an integer number (451984255380).
Almost surely, 210606401022008 is an apocalyptic number.
It is an amenable number.
10606401022008 is an abundant number, since it is smaller than the sum of its proper divisors (18320591322312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10606401022008 is a wasteful number, since it uses less digits than its factorization.
10606401022008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616828 (or 616824 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 30.
Adding to 10606401022008 its reverse (80022010460601), we get a palindrome (90628411482609).
The spelling of 10606401022008 in words is "ten trillion, six hundred six billion, four hundred one million, twenty-two thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •