Base | Representation |
---|---|
bin | 1001000001101001001… |
… | …11000110100101001001 |
3 | 1002122110211002002200122 |
4 | 10200310213012211021 |
5 | 20040111244423423 |
6 | 354244534313025 |
7 | 31256033102504 |
oct | 4406447064511 |
9 | 1078424062618 |
10 | 310120311113 |
11 | 10a580915888 |
12 | 5012a7b8775 |
13 | 23323721792 |
14 | 1101d26213b |
15 | 8100dd48c8 |
hex | 48349c6949 |
310120311113 has 2 divisors, whose sum is σ = 310120311114. Its totient is φ = 310120311112.
The previous prime is 310120311091. The next prime is 310120311167. The reversal of 310120311113 is 311113021013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 279219241744 + 30901069369 = 528412^2 + 175787^2 .
It is a cyclic number.
It is not a de Polignac number, because 310120311113 - 234 = 292940441929 is a prime.
It is a super-2 number, since 2×3101203111132 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 310120311091 and 310120311100.
It is not a weakly prime, because it can be changed into another prime (310120316113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155060155556 + 155060155557.
It is an arithmetic number, because the mean of its divisors is an integer number (155060155557).
Almost surely, 2310120311113 is an apocalyptic number.
It is an amenable number.
310120311113 is a deficient number, since it is larger than the sum of its proper divisors (1).
310120311113 is an equidigital number, since it uses as much as digits as its factorization.
310120311113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 310120311113 its reverse (311113021013), we get a palindrome (621233332126).
The spelling of 310120311113 in words is "three hundred ten billion, one hundred twenty million, three hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •