Base | Representation |
---|---|
bin | 11110100011110011001… |
… | …000000100111000111000 |
3 | 21102202112012210210020120 |
4 | 132203303020010320320 |
5 | 233401321343133422 |
6 | 4244423125253240 |
7 | 304502346104352 |
oct | 36436310047070 |
9 | 7382465723216 |
10 | 2100023021112 |
11 | 73a68427aaa5 |
12 | 29abb9564220 |
13 | 123053a74373 |
14 | 738da9c40d2 |
15 | 3995e26345c |
hex | 1e8f3204e38 |
2100023021112 has 32 divisors (see below), whose sum is σ = 5478320926080. Its totient is φ = 669572557280.
The previous prime is 2100023021101. The next prime is 2100023021119. The reversal of 2100023021112 is 2111203200012.
It is a junction number, because it is equal to n+sod(n) for n = 2100023021091 and 2100023021100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100023021119) 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 7 ways as a sum of consecutive naturals, for example, 1902194214 + ... + 1902195317.
It is an arithmetic number, because the mean of its divisors is an integer number (171197528940).
Almost surely, 22100023021112 is an apocalyptic number.
It is an amenable number.
2100023021112 is an abundant number, since it is smaller than the sum of its proper divisors (3378297904968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2100023021112 is a wasteful number, since it uses less digits than its factorization.
2100023021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3804389563 (or 3804389559 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2100023021112 its reverse (2111203200012), we get a palindrome (4211226221124).
The spelling of 2100023021112 in words is "two trillion, one hundred billion, twenty-three million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •