Base | Representation |
---|---|
bin | 11101011101001101000… |
… | …01001001110000100001 |
3 | 10120202102202110010221112 |
4 | 32232212201021300201 |
5 | 113040300410220022 |
6 | 2052542443433105 |
7 | 133060024515254 |
oct | 16564641116041 |
9 | 3522382403845 |
10 | 1012111023137 |
11 | 360263317925 |
12 | 1441a1b25795 |
13 | 74598433316 |
14 | 36db4ac509b |
15 | 1b4d9b178e2 |
hex | eba6849c21 |
1012111023137 has 2 divisors, whose sum is σ = 1012111023138. Its totient is φ = 1012111023136.
The previous prime is 1012111023107. The next prime is 1012111023167. The reversal of 1012111023137 is 7313201112101.
It is a balanced prime because it is at equal distance from previous prime (1012111023107) and next prime (1012111023167).
It can be written as a sum of positive squares in only one way, i.e., 843723079936 + 168387943201 = 918544^2 + 410351^2 .
It is an emirp because it is prime and its reverse (7313201112101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1012111023137 - 216 = 1012110957601 is a prime.
It is not a weakly prime, because it can be changed into another prime (1012111023107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506055511568 + 506055511569.
It is an arithmetic number, because the mean of its divisors is an integer number (506055511569).
Almost surely, 21012111023137 is an apocalyptic number.
It is an amenable number.
1012111023137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012111023137 is an equidigital number, since it uses as much as digits as its factorization.
1012111023137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 1012111023137 its reverse (7313201112101), we get a palindrome (8325312135238).
The spelling of 1012111023137 in words is "one trillion, twelve billion, one hundred eleven million, twenty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.550 sec. • engine limits •