Base | Representation |
---|---|
bin | 1010000000101000101110… |
… | …11101100101000100110001 |
3 | 2212221100002011111222002212 |
4 | 11000110113131211010301 |
5 | 10341121240330201001 |
6 | 114452115234021505 |
7 | 4431215245353326 |
oct | 500242735450461 |
9 | 85840064458085 |
10 | 22012101022001 |
11 | 7017309199852 |
12 | 2576114117895 |
13 | c389698c064c |
14 | 561569d04b4d |
15 | 2828ba3db7bb |
hex | 140517765131 |
22012101022001 has 16 divisors (see below), whose sum is σ = 22294306985040. Its totient is φ = 21731463936000.
The previous prime is 22012101021961. The next prime is 22012101022081. The reversal of 22012101022001 is 10022010121022.
It can be written as a sum of positive squares in 8 ways, for example, as 16905879528976 + 5106221493025 = 4111676^2 + 2259695^2 .
It is a cyclic number.
It is not a de Polignac number, because 22012101022001 - 222 = 22012096827697 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22012101022081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 143792501 + ... + 143945501.
It is an arithmetic number, because the mean of its divisors is an integer number (1393394186565).
Almost surely, 222012101022001 is an apocalyptic number.
It is an amenable number.
22012101022001 is a deficient number, since it is larger than the sum of its proper divisors (282205963039).
22012101022001 is a wasteful number, since it uses less digits than its factorization.
22012101022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158116.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22012101022001 its reverse (10022010121022), we get a palindrome (32034111143023).
The spelling of 22012101022001 in words is "twenty-two trillion, twelve billion, one hundred one million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •