Base | Representation |
---|---|
bin | 1001001100000000111011… |
… | …0101111110110011110000 |
3 | 1022202202001121000110222220 |
4 | 2103000032311332303300 |
5 | 2311002410100041422 |
6 | 33252444510401040 |
7 | 2061563164112004 |
oct | 223001665766360 |
9 | 38682047013886 |
10 | 10102012112112 |
11 | 324526a529798 |
12 | 1171a07500180 |
13 | 58380079333b |
14 | 26cd234bc704 |
15 | 127b9ab33e5c |
hex | 9300ed7ecf0 |
10102012112112 has 40 divisors (see below), whose sum is σ = 26097097405056. Its totient is φ = 3367307334336.
The previous prime is 10102012112083. The next prime is 10102012112131. The reversal of 10102012112112 is 21121121020101.
It is a happy number.
10102012112112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10102012112091 and 10102012112100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4869093 + ... + 6626619.
Almost surely, 210102012112112 is an apocalyptic number.
10102012112112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10102012112112 is an abundant number, since it is smaller than the sum of its proper divisors (15995085292944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102012112112 is a wasteful number, since it uses less digits than its factorization.
10102012112112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1877285 (or 1877279 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10102012112112 its reverse (21121121020101), we get a palindrome (31223133132213).
The spelling of 10102012112112 in words is "ten trillion, one hundred two billion, twelve million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •