Base | Representation |
---|---|
bin | 11101011001011110100… |
… | …00001111011010010001 |
3 | 10120120021022100202222022 |
4 | 32230233100033122101 |
5 | 113022201141214022 |
6 | 2052012125021225 |
7 | 132656320123364 |
oct | 16545720173221 |
9 | 3516238322868 |
10 | 1010110101137 |
11 | 35a426900585 |
12 | 1439239b4815 |
13 | 74339a253c7 |
14 | 36c6506a0db |
15 | 1b41e121c42 |
hex | eb2f40f691 |
1010110101137 has 2 divisors, whose sum is σ = 1010110101138. Its totient is φ = 1010110101136.
The previous prime is 1010110101041. The next prime is 1010110101139. The reversal of 1010110101137 is 7311010110101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 626700222736 + 383409878401 = 791644^2 + 619201^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010110101137 - 218 = 1010109838993 is a prime.
Together with 1010110101139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1010110101139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505055050568 + 505055050569.
It is an arithmetic number, because the mean of its divisors is an integer number (505055050569).
Almost surely, 21010110101137 is an apocalyptic number.
It is an amenable number.
1010110101137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010110101137 is an equidigital number, since it uses as much as digits as its factorization.
1010110101137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 17.
Adding to 1010110101137 its reverse (7311010110101), we get a palindrome (8321120211238).
The spelling of 1010110101137 in words is "one trillion, ten billion, one hundred ten million, one hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •