Base | Representation |
---|---|
bin | 1010000110001000100101… |
… | …10001110100000000110011 |
3 | 2220121101122221011011100202 |
4 | 11003010102301310000303 |
5 | 10402220122224013021 |
6 | 115114555444105415 |
7 | 4450653333604160 |
oct | 503042261640063 |
9 | 86541587134322 |
10 | 22201001001011 |
11 | 708a434316988 |
12 | 25a685239526b |
13 | c50712364c61 |
14 | 56a769b1b067 |
15 | 287774115a0b |
hex | 143112c74033 |
22201001001011 has 8 divisors (see below), whose sum is σ = 25411074205440. Its totient is φ = 19000553204808.
The previous prime is 22201001000957. The next prime is 22201001001031. The reversal of 22201001001011 is 11010010010222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22201001001011 - 26 = 22201001000947 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22201001000983 and 22201001001001.
It is not an unprimeable number, because it can be changed into a prime (22201001001031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2406347111 + ... + 2406356336.
It is an arithmetic number, because the mean of its divisors is an integer number (3176384275680).
Almost surely, 222201001001011 is an apocalyptic number.
22201001001011 is a deficient number, since it is larger than the sum of its proper divisors (3210073204429).
22201001001011 is an equidigital number, since it uses as much as digits as its factorization.
22201001001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4812704113.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 22201001001011 its reverse (11010010010222), we get a palindrome (33211011011233).
The spelling of 22201001001011 in words is "twenty-two trillion, two hundred one billion, one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •