Base | Representation |
---|---|
bin | 11110100100110100101… |
… | …000110011101001101100 |
3 | 21102212100210221210212220 |
4 | 132210310220303221230 |
5 | 233411044230322200 |
6 | 4245124150555340 |
7 | 304541523226230 |
oct | 36446450635154 |
9 | 7385323853786 |
10 | 2101122120300 |
11 | 74009872a535 |
12 | 29b265668b50 |
13 | 12319a69b008 |
14 | 739a296a5c0 |
15 | 399c59bc4a0 |
hex | 1e934a33a6c |
2101122120300 has 144 divisors (see below), whose sum is σ = 7045566054912. Its totient is φ = 473492275200.
The previous prime is 2101122120277. The next prime is 2101122120319. The reversal of 2101122120300 is 30212211012.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2101122120300.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6896917 + ... + 7195116.
It is an arithmetic number, because the mean of its divisors is an integer number (48927542048).
Almost surely, 22101122120300 is an apocalyptic number.
2101122120300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2101122120300 is an abundant number, since it is smaller than the sum of its proper divisors (4944443934612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101122120300 is a wasteful number, since it uses less digits than its factorization.
2101122120300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14092128 (or 14092121 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2101122120300 its reverse (30212211012), we get a palindrome (2131334331312).
The spelling of 2101122120300 in words is "two trillion, one hundred one billion, one hundred twenty-two million, one hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •