Base | Representation |
---|---|
bin | 1001100011100010010100… |
… | …00010101001101011010101 |
3 | 2202101202012220011002102010 |
4 | 10301301022002221223111 |
5 | 10223231012342033023 |
6 | 112404514233134433 |
7 | 4266040311651222 |
oct | 461611202515325 |
9 | 82352186132363 |
10 | 21012222221013 |
11 | 6771262724531 |
12 | 243438685a419 |
13 | b955a077b6ca |
14 | 528dd5a0a949 |
15 | 266899616093 |
hex | 131c4a0a9ad5 |
21012222221013 has 8 divisors (see below), whose sum is σ = 28157081704000. Its totient is φ = 13937755442688.
The previous prime is 21012222220987. The next prime is 21012222221027. The reversal of 21012222221013 is 31012222221012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21012222221013 - 28 = 21012222220757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21012222221713) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17598175468 + ... + 17598176661.
It is an arithmetic number, because the mean of its divisors is an integer number (3519635213000).
Almost surely, 221012222221013 is an apocalyptic number.
It is an amenable number.
21012222221013 is a deficient number, since it is larger than the sum of its proper divisors (7144859482987).
21012222221013 is a wasteful number, since it uses less digits than its factorization.
21012222221013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35196352331.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 21012222221013 its reverse (31012222221012), we get a palindrome (52024444442025).
Subtracting 21012222221013 from its reverse (31012222221012), we obtain a palindrome (9999999999999).
The spelling of 21012222221013 in words is "twenty-one trillion, twelve billion, two hundred twenty-two million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •