Base | Representation |
---|---|
bin | 10011101011011101… |
… | …010110111100110000 |
3 | 2000112121012221102212 |
4 | 103223131112330300 |
5 | 321233313223440 |
6 | 13412421431252 |
7 | 1345424555024 |
oct | 235335267460 |
9 | 60477187385 |
10 | 21130211120 |
11 | 8a634a93a7 |
12 | 411856b528 |
13 | 1cb98a5705 |
14 | 104644a384 |
15 | 83a0bd465 |
hex | 4eb756f30 |
21130211120 has 80 divisors (see below), whose sum is σ = 50221928448. Its totient is φ = 8264190720.
The previous prime is 21130211117. The next prime is 21130211173. The reversal of 21130211120 is 2111203112.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 21130211095 and 21130211104.
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, 5137865 + ... + 5141975.
Almost surely, 221130211120 is an apocalyptic number.
21130211120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21130211120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25110964224).
21130211120 is an abundant number, since it is smaller than the sum of its proper divisors (29091717328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21130211120 is a wasteful number, since it uses less digits than its factorization.
21130211120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5538 (or 5532 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 21130211120 its reverse (2111203112), we get a palindrome (23241414232).
The spelling of 21130211120 in words is "twenty-one billion, one hundred thirty million, two hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •