Base | Representation |
---|---|
bin | 1110001111001111111110… |
… | …11111010010000100110001 |
3 | 11002212020100211222101221202 |
4 | 13013213333133102010301 |
5 | 13100442000032323441 |
6 | 150331431000100545 |
7 | 6411044332253111 |
oct | 707477737220461 |
9 | 132766324871852 |
10 | 31310303011121 |
11 | 9a81696878a72 |
12 | 3618191164755 |
13 | 1461719c37374 |
14 | 7a35d9013041 |
15 | 3946bd4b319b |
hex | 1c79ff7d2131 |
31310303011121 has 2 divisors, whose sum is σ = 31310303011122. Its totient is φ = 31310303011120.
The previous prime is 31310303011087. The next prime is 31310303011151. The reversal of 31310303011121 is 12111030301313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30824270945521 + 486032065600 = 5551961^2 + 697160^2 .
It is a cyclic number.
It is not a de Polignac number, because 31310303011121 - 234 = 31293123141937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31310303011093 and 31310303011102.
It is not a weakly prime, because it can be changed into another prime (31310303011151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15655151505560 + 15655151505561.
It is an arithmetic number, because the mean of its divisors is an integer number (15655151505561).
Almost surely, 231310303011121 is an apocalyptic number.
It is an amenable number.
31310303011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
31310303011121 is an equidigital number, since it uses as much as digits as its factorization.
31310303011121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 31310303011121 its reverse (12111030301313), we get a palindrome (43421333312434).
The spelling of 31310303011121 in words is "thirty-one trillion, three hundred ten billion, three hundred three million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •