Base | Representation |
---|---|
bin | 10011101010010100… |
… | …011111100111101000 |
3 | 2000111021021111210102 |
4 | 103222110133213220 |
5 | 321213421010440 |
6 | 13410500204532 |
7 | 1345103322002 |
oct | 235224374750 |
9 | 60437244712 |
10 | 21111110120 |
11 | 8a53742551 |
12 | 4112099748 |
13 | 1cb5948549 |
14 | 1043ab7372 |
15 | 838598b15 |
hex | 4ea51f9e8 |
21111110120 has 32 divisors (see below), whose sum is σ = 47508642720. Its totient is φ = 8442907200.
The previous prime is 21111110093. The next prime is 21111110123. The reversal of 21111110120 is 2101111112.
It is a super-3 number, since 3×211111101203 (a number of 32 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (21111110123) 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 7 ways as a sum of consecutive naturals, for example, 188939 + ... + 279141.
It is an arithmetic number, because the mean of its divisors is an integer number (1484645085).
Almost surely, 221111110120 is an apocalyptic number.
21111110120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21111110120 is an abundant number, since it is smaller than the sum of its proper divisors (26397532600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21111110120 is a wasteful number, since it uses less digits than its factorization.
21111110120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96065 (or 96061 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 21111110120 its reverse (2101111112), we get a palindrome (23212221232).
The spelling of 21111110120 in words is "twenty-one billion, one hundred eleven million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •