Base | Representation |
---|---|
bin | 10011000100001000110… |
… | …101101101100000010111 |
3 | 11122020122001100111022211 |
4 | 103010020311231200113 |
5 | 132431103002314111 |
6 | 2441505135134251 |
7 | 163436554335232 |
oct | 23041065554027 |
9 | 4566561314284 |
10 | 1310113323031 |
11 | 4656858a84a7 |
12 | 191aaa374387 |
13 | 9670a411656 |
14 | 475a47aa419 |
15 | 2412bc1a521 |
hex | 13108d6d817 |
1310113323031 has 2 divisors, whose sum is σ = 1310113323032. Its totient is φ = 1310113323030.
The previous prime is 1310113323023. The next prime is 1310113323037. The reversal of 1310113323031 is 1303233110131.
It is a strong prime.
It is an emirp because it is prime and its reverse (1303233110131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1310113323031 - 23 = 1310113323023 is a prime.
It is a super-2 number, since 2×13101133230312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1310113322993 and 1310113323011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310113323037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655056661515 + 655056661516.
It is an arithmetic number, because the mean of its divisors is an integer number (655056661516).
Almost surely, 21310113323031 is an apocalyptic number.
1310113323031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310113323031 is an equidigital number, since it uses as much as digits as its factorization.
1310113323031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1310113323031 its reverse (1303233110131), we get a palindrome (2613346433162).
The spelling of 1310113323031 in words is "one trillion, three hundred ten billion, one hundred thirteen million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •