Base | Representation |
---|---|
bin | 1001100110011000101010… |
… | …01101000111110000001000 |
3 | 2202202002220120010121101002 |
4 | 10303030111031013300020 |
5 | 10231332011211133000 |
6 | 112521504422514132 |
7 | 4306104311350553 |
oct | 463142515076010 |
9 | 82662816117332 |
10 | 21110120021000 |
11 | 67a982a45964a |
12 | 244b348595948 |
13 | ba18a28acaca |
14 | 52da417ab69a |
15 | 2691c90018d5 |
hex | 133315347c08 |
21110120021000 has 64 divisors (see below), whose sum is σ = 49532280295680. Its totient is φ = 8421039556800.
The previous prime is 21110120020999. The next prime is 21110120021009. The reversal of 21110120021000 is 12002101112.
It is not an unprimeable number, because it can be changed into a prime (21110120021009) 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 15 ways as a sum of consecutive naturals, for example, 28393382 + ... + 29127381.
It is an arithmetic number, because the mean of its divisors is an integer number (773941879620).
Almost surely, 221110120021000 is an apocalyptic number.
21110120021000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21110120021000 is an abundant number, since it is smaller than the sum of its proper divisors (28422160274680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21110120021000 is a wasteful number, since it uses less digits than its factorization.
21110120021000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57521151 (or 57521137 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21110120021000 its reverse (12002101112), we get a palindrome (21122122122112).
The spelling of 21110120021000 in words is "twenty-one trillion, one hundred ten billion, one hundred twenty million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •