Base | Representation |
---|---|
bin | 101111001000010110… |
… | …1100100100101001111 |
3 | 100200020122110002000100 |
4 | 1132100231210211033 |
5 | 3124240300110411 |
6 | 114255102502143 |
7 | 10212062524215 |
oct | 1362055444517 |
9 | 320218402010 |
10 | 101212113231 |
11 | 39a18665779 |
12 | 17747894953 |
13 | 970c9855c8 |
14 | 4c82024cb5 |
15 | 2975869456 |
hex | 1790b6494f |
101212113231 has 24 divisors (see below), whose sum is σ = 150063207840. Its totient is φ = 65711448000.
The previous prime is 101212113227. The next prime is 101212113283. The reversal of 101212113231 is 132311212101.
101212113231 is a `hidden beast` number, since 10 + 121 + 211 + 323 + 1 = 666.
It is not a de Polignac number, because 101212113231 - 22 = 101212113227 is a prime.
It is a super-2 number, since 2×1012121132312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101212113031) 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 23 ways as a sum of consecutive naturals, for example, 857211 + ... + 968108.
It is an arithmetic number, because the mean of its divisors is an integer number (6252633660).
Almost surely, 2101212113231 is an apocalyptic number.
101212113231 is a deficient number, since it is larger than the sum of its proper divisors (48851094609).
101212113231 is a wasteful number, since it uses less digits than its factorization.
101212113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1825487 (or 1825484 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 101212113231 its reverse (132311212101), we get a palindrome (233523325332).
The spelling of 101212113231 in words is "one hundred one billion, two hundred twelve million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •