Base | Representation |
---|---|
bin | 11101011001011110100… |
… | …11101101100101000011 |
3 | 10120120021101002000021002 |
4 | 32230233103231211003 |
5 | 113022201404324024 |
6 | 2052012200322215 |
7 | 132656330633426 |
oct | 16545723554503 |
9 | 3516241060232 |
10 | 1010111011139 |
11 | 35a42737224a |
12 | 14392417336b |
13 | 74339c83679 |
14 | 36c652259bd |
15 | 1b41e2516ae |
hex | eb2f4ed943 |
1010111011139 has 2 divisors, whose sum is σ = 1010111011140. Its totient is φ = 1010111011138.
The previous prime is 1010111011099. The next prime is 1010111011159. The reversal of 1010111011139 is 9311101110101.
It is an a-pointer prime, because the next prime (1010111011159) can be obtained adding 1010111011139 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1010111011139 - 236 = 941391534403 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010111011139.
It is not a weakly prime, because it can be changed into another prime (1010111011159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505055505569 + 505055505570.
It is an arithmetic number, because the mean of its divisors is an integer number (505055505570).
Almost surely, 21010111011139 is an apocalyptic number.
1010111011139 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010111011139 is an equidigital number, since it uses as much as digits as its factorization.
1010111011139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 1010111011139 in words is "one trillion, ten billion, one hundred eleven million, eleven thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •