Base | Representation |
---|---|
bin | 11101011001011110101… |
… | …00000011110010111001 |
3 | 10120120021101020122002101 |
4 | 32230233110003302321 |
5 | 113022201420232022 |
6 | 2052012202303401 |
7 | 132656331462634 |
oct | 16545724036271 |
9 | 3516241218071 |
10 | 1010111102137 |
11 | 35a427424655 |
12 | 1439241b7b61 |
13 | 74339cb5c07 |
14 | 36c6524ac1b |
15 | 1b41e26d627 |
hex | eb2f503cb9 |
1010111102137 has 2 divisors, whose sum is σ = 1010111102138. Its totient is φ = 1010111102136.
The previous prime is 1010111102093. The next prime is 1010111102141. The reversal of 1010111102137 is 7312011110101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 647991190441 + 362119911696 = 804979^2 + 601764^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010111102137 - 215 = 1010111069369 is a prime.
It is not a weakly prime, because it can be changed into another prime (1010111102167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505055551068 + 505055551069.
It is an arithmetic number, because the mean of its divisors is an integer number (505055551069).
Almost surely, 21010111102137 is an apocalyptic number.
It is an amenable number.
1010111102137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010111102137 is an equidigital number, since it uses as much as digits as its factorization.
1010111102137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42, while the sum is 19.
Adding to 1010111102137 its reverse (7312011110101), we get a palindrome (8322122212238).
The spelling of 1010111102137 in words is "one trillion, ten billion, one hundred eleven million, one hundred two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •