Base | Representation |
---|---|
bin | 11110101110111110010… |
… | …001001001110101010100 |
3 | 21110220111101022212011210 |
4 | 132232332101021311110 |
5 | 234100404401010400 |
6 | 4254125450101420 |
7 | 305405565141546 |
oct | 36567621116524 |
9 | 7426441285153 |
10 | 2112021110100 |
11 | 744780946920 |
12 | 2a13a771a870 |
13 | 1242166ba0c5 |
14 | 74318265696 |
15 | 39e12757950 |
hex | 1ebbe449d54 |
2112021110100 has 144 divisors (see below), whose sum is σ = 6732310729536. Its totient is φ = 506935680000.
The previous prime is 2112021110027. The next prime is 2112021110141. The reversal of 2112021110100 is 10111202112.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2835049 + ... + 3501648.
It is an arithmetic number, because the mean of its divisors is an integer number (46752157844).
Almost surely, 22112021110100 is an apocalyptic number.
2112021110100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2112021110100 is an abundant number, since it is smaller than the sum of its proper divisors (4620289619436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112021110100 is a wasteful number, since it uses less digits than its factorization.
2112021110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6336826 (or 6336819 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2112021110100 its reverse (10111202112), we get a palindrome (2122132312212).
The spelling of 2112021110100 in words is "two trillion, one hundred twelve billion, twenty-one million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •