Base | Representation |
---|---|
bin | 101111001000010110… |
… | …1100011110100100000 |
3 | 100200020122102220201211 |
4 | 1132100231203310200 |
5 | 3124240300010422 |
6 | 114255102435504 |
7 | 10212062512141 |
oct | 1362055436440 |
9 | 320218386654 |
10 | 101212110112 |
11 | 39a186633a3 |
12 | 17747892b94 |
13 | 970c984069 |
14 | 4c82023ac8 |
15 | 2975868577 |
hex | 1790b63d20 |
101212110112 has 24 divisors (see below), whose sum is σ = 210982598316. Its totient is φ = 47629228032.
The previous prime is 101212110101. The next prime is 101212110137. The reversal of 101212110112 is 211011212101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 83310740496 + 17901369616 = 288636^2 + 133796^2 .
It is a super-2 number, since 2×1012121101122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101212110092 and 101212110101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 93025293 + ... + 93026380.
Almost surely, 2101212110112 is an apocalyptic number.
It is an amenable number.
101212110112 is an abundant number, since it is smaller than the sum of its proper divisors (109770488204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101212110112 is a wasteful number, since it uses less digits than its factorization.
101212110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186051700 (or 186051692 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101212110112 its reverse (211011212101), we get a palindrome (312223322213).
The spelling of 101212110112 in words is "one hundred one billion, two hundred twelve million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •