Base | Representation |
---|---|
bin | 1010000000111001010011… |
… | …11100010011110010001001 |
3 | 2212222012001102101210122012 |
4 | 11000130221330103302021 |
5 | 10341243002224031441 |
6 | 114500150323305305 |
7 | 4431651635060252 |
oct | 500345174236211 |
9 | 85865042353565 |
10 | 22021001002121 |
11 | 7020065a85620 |
12 | 257799881b235 |
13 | c39757721084 |
14 | 561b71d21b29 |
15 | 282c3b90c9eb |
hex | 140729f13c89 |
22021001002121 has 16 divisors (see below), whose sum is σ = 24224870596608. Its totient is φ = 19851026067600.
The previous prime is 22021001002067. The next prime is 22021001002123. The reversal of 22021001002121 is 12120010012022.
It is a cyclic number.
It is not a de Polignac number, because 22021001002121 - 242 = 17622954491017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 22021001002096 and 22021001002105.
It is not an unprimeable number, because it can be changed into a prime (22021001002123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3986441 + ... + 7741686.
It is an arithmetic number, because the mean of its divisors is an integer number (1514054412288).
Almost surely, 222021001002121 is an apocalyptic number.
It is an amenable number.
22021001002121 is a deficient number, since it is larger than the sum of its proper divisors (2203869594487).
22021001002121 is a wasteful number, since it uses less digits than its factorization.
22021001002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11729572.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22021001002121 its reverse (12120010012022), we get a palindrome (34141011014143).
Subtracting from 22021001002121 its reverse (12120010012022), we obtain a palindrome (9900990990099).
The spelling of 22021001002121 in words is "twenty-two trillion, twenty-one billion, one million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.445 sec. • engine limits •