Base | Representation |
---|---|
bin | 10011101010111010… |
… | …101001000001101000 |
3 | 2000111222002120012210 |
4 | 103222322221001220 |
5 | 321224001010440 |
6 | 13411454405120 |
7 | 1345254321345 |
oct | 235272510150 |
9 | 60458076183 |
10 | 21121110120 |
11 | 8a59352710 |
12 | 41155007a0 |
13 | 1cb7a3a0c6 |
14 | 104515b7cc |
15 | 8393c1a80 |
hex | 4eaea9068 |
21121110120 has 64 divisors (see below), whose sum is σ = 69123637440. Its totient is φ = 5120268800.
The previous prime is 21121110041. The next prime is 21121110161. The reversal of 21121110120 is 2101112112.
It is a super-2 number, since 2×211211101202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 21121110096 and 21121110105.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7999101 + ... + 8001740.
It is an arithmetic number, because the mean of its divisors is an integer number (1080056835).
Almost surely, 221121110120 is an apocalyptic number.
21121110120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21121110120 is an abundant number, since it is smaller than the sum of its proper divisors (48002527320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21121110120 is a wasteful number, since it uses less digits than its factorization.
21121110120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16000866 (or 16000862 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 21121110120 its reverse (2101112112), we get a palindrome (23222222232).
The spelling of 21121110120 in words is "twenty-one billion, one hundred twenty-one million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •