Base | Representation |
---|---|
bin | 10011101010010100… |
… | …000101001111111110 |
3 | 2000111021002000122001 |
4 | 103222110011033332 |
5 | 321213404031420 |
6 | 13410454012514 |
7 | 1345102362052 |
oct | 235224051776 |
9 | 60437060561 |
10 | 21111002110 |
11 | 8a53679390 |
12 | 411204713a |
13 | 1cb590b333 |
14 | 1043a89c62 |
15 | 838576b0a |
hex | 4ea5053fe |
21111002110 has 64 divisors (see below), whose sum is σ = 43048558080. Its totient is φ = 7383537280.
The previous prime is 21111002063. The next prime is 21111002117. The reversal of 21111002110 is 1120011112.
21111002110 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21111002117) 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 31 ways as a sum of consecutive naturals, for example, 826389 + ... + 851551.
It is an arithmetic number, because the mean of its divisors is an integer number (672633720).
Almost surely, 221111002110 is an apocalyptic number.
21111002110 is an abundant number, since it is smaller than the sum of its proper divisors (21937555970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21111002110 is a wasteful number, since it uses less digits than its factorization.
21111002110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25473.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 21111002110 its reverse (1120011112), we get a palindrome (22231013222).
It can be divided in two parts, 21111002 and 110, that added together give a palindrome (21111112).
The spelling of 21111002110 in words is "twenty-one billion, one hundred eleven million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •