Base | Representation |
---|---|
bin | 10110101111010111100010… |
… | …111001000111110000000011 |
3 | 111010010001202121110000111121 |
4 | 112233113202321013300003 |
5 | 101102044310222042011 |
6 | 552412533402453111 |
7 | 30031431366325153 |
oct | 2657274271076003 |
9 | 433101677400447 |
10 | 100012120112131 |
11 | 299599a1546877 |
12 | b273028804197 |
13 | 43a6144143726 |
14 | 1a9a880778763 |
15 | b86828868e71 |
hex | 5af5e2e47c03 |
100012120112131 has 2 divisors, whose sum is σ = 100012120112132. Its totient is φ = 100012120112130.
The previous prime is 100012120112029. The next prime is 100012120112147. The reversal of 100012120112131 is 131211021210001.
It is a happy number.
It is an a-pointer prime, because the next prime (100012120112147) can be obtained adding 100012120112131 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100012120112131 - 231 = 100009972628483 is a prime.
It is a super-2 number, since 2×1000121201121312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100012120112731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50006060056065 + 50006060056066.
It is an arithmetic number, because the mean of its divisors is an integer number (50006060056066).
Almost surely, 2100012120112131 is an apocalyptic number.
100012120112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
100012120112131 is an equidigital number, since it uses as much as digits as its factorization.
100012120112131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 100012120112131 its reverse (131211021210001), we get a palindrome (231223141322132).
The spelling of 100012120112131 in words is "one hundred trillion, twelve billion, one hundred twenty million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •