Base | Representation |
---|---|
bin | 1001000110110010011011… |
… | …1100010001001010010000 |
3 | 1022110011021222021021020220 |
4 | 2101230212330101022100 |
5 | 2303020012324200422 |
6 | 33143315031033040 |
7 | 2052234124442241 |
oct | 221544674211220 |
9 | 38404258237226 |
10 | 10012222100112 |
11 | 32101833a2801 |
12 | 1158528b0b780 |
13 | 5781c131461b |
14 | 268846442cc8 |
15 | 125692e35e5c |
hex | 91b26f11290 |
10012222100112 has 80 divisors (see below), whose sum is σ = 25919045860608. Its totient is φ = 3330425488000.
The previous prime is 10012222100071. The next prime is 10012222100161. The reversal of 10012222100112 is 21100122221001.
It is a super-3 number, since 3×100122221001123 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10012222100091 and 10012222100100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87798043 + ... + 87912005.
Almost surely, 210012222100112 is an apocalyptic number.
10012222100112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10012222100112 is an abundant number, since it is smaller than the sum of its proper divisors (15906823760496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012222100112 is a wasteful number, since it uses less digits than its factorization.
10012222100112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117788 (or 117782 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10012222100112 its reverse (21100122221001), we get a palindrome (31112344321113).
The spelling of 10012222100112 in words is "ten trillion, twelve billion, two hundred twenty-two million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •