Base | Representation |
---|---|
bin | 1001100011001111011110… |
… | …10100000011100001111111 |
3 | 2202100210010011110020111120 |
4 | 10301213233110003201333 |
5 | 10223044310142401421 |
6 | 112400123003522023 |
7 | 4265231603353266 |
oct | 461475724034177 |
9 | 82323104406446 |
10 | 21002110122111 |
11 | 6767a437049a8 |
12 | 2432424229313 |
13 | b9464b7a2731 |
14 | 528716a275dd |
15 | 2664a69b38c6 |
hex | 1319ef50387f |
21002110122111 has 8 divisors (see below), whose sum is σ = 28002875717040. Its totient is φ = 14001375637632.
The previous prime is 21002110122101. The next prime is 21002110122121. The reversal of 21002110122111 is 11122101120012.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (21002110122101) and next prime (21002110122121).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-21002110122111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21002110122101) 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, 6154000 + ... + 8937333.
It is an arithmetic number, because the mean of its divisors is an integer number (3500359464630).
Almost surely, 221002110122111 is an apocalyptic number.
21002110122111 is a deficient number, since it is larger than the sum of its proper divisors (7000765594929).
21002110122111 is a wasteful number, since it uses less digits than its factorization.
21002110122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15555225.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21002110122111 its reverse (11122101120012), we get a palindrome (32124211242123).
The spelling of 21002110122111 in words is "twenty-one trillion, two billion, one hundred ten million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •