Base | Representation |
---|---|
bin | 1010000110001000111111… |
… | …10101001111000100110101 |
3 | 2220121102020012020120101020 |
4 | 11003010133311033010311 |
5 | 10402221044310031401 |
6 | 115115033310051353 |
7 | 4450661633230260 |
oct | 503043765170465 |
9 | 86542205216336 |
10 | 22201220002101 |
11 | 708a5369a7718 |
12 | 25a68b37a9b59 |
13 | c50748842aba |
14 | 56a78ac47cd7 |
15 | 287788474d36 |
hex | 14311fd4f135 |
22201220002101 has 16 divisors (see below), whose sum is σ = 33834877999104. Its totient is φ = 12684743609904.
The previous prime is 22201220002057. The next prime is 22201220002133. The reversal of 22201220002101 is 10120002210222.
It is not a de Polignac number, because 22201220002101 - 214 = 22201219985717 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22201220002201) by changing a digit.
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, 69328945 + ... + 69648438.
It is an arithmetic number, because the mean of its divisors is an integer number (2114679874944).
Almost surely, 222201220002101 is an apocalyptic number.
22201220002101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
22201220002101 is a deficient number, since it is larger than the sum of its proper divisors (11633657997003).
22201220002101 is a wasteful number, since it uses less digits than its factorization.
22201220002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138985000.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 22201220002101 its reverse (10120002210222), we get a palindrome (32321222212323).
The spelling of 22201220002101 in words is "twenty-two trillion, two hundred one billion, two hundred twenty million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •