Base | Representation |
---|---|
bin | 1010000000010100000011… |
… | …10011010101111010111111 |
3 | 2212220021102112101021221202 |
4 | 11000022001303111322333 |
5 | 10340431022023210421 |
6 | 114443041525050115 |
7 | 4430343203124266 |
oct | 500120163257277 |
9 | 85807375337852 |
10 | 22001000210111 |
11 | 701263206554a |
12 | 2573b3655693b |
13 | c378bab29ac0 |
14 | 560bd58b15dd |
15 | 28246aa8710b |
hex | 140281cd5ebf |
22001000210111 has 32 divisors (see below), whose sum is σ = 25082026052160. Its totient is φ = 19151075026944.
The previous prime is 22001000209973. The next prime is 22001000210153. The reversal of 22001000210111 is 11101200010022.
It is a cyclic number.
It is not a de Polignac number, because 22001000210111 - 210 = 22001000209087 is a prime.
It is a super-2 number, since 2×220010002101112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22001000210092 and 22001000210101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001000210411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 326018105 + ... + 326085581.
It is an arithmetic number, because the mean of its divisors is an integer number (783813314130).
Almost surely, 222001000210111 is an apocalyptic number.
22001000210111 is a deficient number, since it is larger than the sum of its proper divisors (3081025842049).
22001000210111 is a wasteful number, since it uses less digits than its factorization.
22001000210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87675.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 22001000210111 its reverse (11101200010022), we get a palindrome (33102200220133).
The spelling of 22001000210111 in words is "twenty-two trillion, one billion, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •