Base | Representation |
---|---|
bin | 10011000100001001001… |
… | …111101001101011010101 |
3 | 11122020122112010222020222 |
4 | 103010021033221223111 |
5 | 132431111222414333 |
6 | 2441505541004125 |
7 | 163436666206415 |
oct | 23041117515325 |
9 | 4566575128228 |
10 | 1310120123093 |
11 | 465689722491 |
12 | 191ab06b3645 |
13 | 9670b952862 |
14 | 475a565a645 |
15 | 2412c610298 |
hex | 131093e9ad5 |
1310120123093 has 2 divisors, whose sum is σ = 1310120123094. Its totient is φ = 1310120123092.
The previous prime is 1310120123089. The next prime is 1310120123119. The reversal of 1310120123093 is 3903210210131.
It is an a-pointer prime, because the next prime (1310120123119) can be obtained adding 1310120123093 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1120161874129 + 189958248964 = 1058377^2 + 435842^2 .
It is an emirp because it is prime and its reverse (3903210210131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1310120123093 - 22 = 1310120123089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310120123083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655060061546 + 655060061547.
It is an arithmetic number, because the mean of its divisors is an integer number (655060061547).
Almost surely, 21310120123093 is an apocalyptic number.
It is an amenable number.
1310120123093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310120123093 is an equidigital number, since it uses as much as digits as its factorization.
1310120123093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 1310120123093 in words is "one trillion, three hundred ten billion, one hundred twenty million, one hundred twenty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •