Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0011110101010011001 |
3 | 100122222200110120110020 |
4 | 1132022300132222121 |
5 | 3124034211241441 |
6 | 114241133341053 |
7 | 10206440423304 |
oct | 1361260365231 |
9 | 318880416406 |
10 | 101112212121 |
11 | 39977231578 |
12 | 1771a337789 |
13 | 96c5077b1b |
14 | 4c72a5bb3b |
15 | 296bbd3e66 |
hex | 178ac1ea99 |
101112212121 has 8 divisors (see below), whose sum is σ = 134868285600. Its totient is φ = 67382140032.
The previous prime is 101112212023. The next prime is 101112212143. The reversal of 101112212121 is 121212211101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101112212121 - 29 = 101112211609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101112212121.
It is not an unprimeable number, because it can be changed into a prime (101112212521) 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, 6491271 + ... + 6506828.
It is an arithmetic number, because the mean of its divisors is an integer number (16858535700).
Almost surely, 2101112212121 is an apocalyptic number.
It is an amenable number.
101112212121 is a deficient number, since it is larger than the sum of its proper divisors (33756073479).
101112212121 is a wasteful number, since it uses less digits than its factorization.
101112212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13000695.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101112212121 its reverse (121212211101), we get a palindrome (222324423222).
The spelling of 101112212121 in words is "one hundred one billion, one hundred twelve million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •