Base | Representation |
---|---|
bin | 1001000010000000001… |
… | …10100111101000010001 |
3 | 1002122222020212220221111 |
4 | 10201000012213220101 |
5 | 20041010124403241 |
6 | 354320023053321 |
7 | 31263564006346 |
oct | 4410006475021 |
9 | 1078866786844 |
10 | 310313122321 |
11 | 10a66a738794 |
12 | 501832a1241 |
13 | 2335465c957 |
14 | 1103aad27cd |
15 | 8112cbdc81 |
hex | 48401a7a11 |
310313122321 has 2 divisors, whose sum is σ = 310313122322. Its totient is φ = 310313122320.
The previous prime is 310313122261. The next prime is 310313122349. The reversal of 310313122321 is 123221313013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 163267716096 + 147045406225 = 404064^2 + 383465^2 .
It is a cyclic number.
It is not a de Polignac number, because 310313122321 - 27 = 310313122193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 310313122292 and 310313122301.
It is not a weakly prime, because it can be changed into another prime (310313125321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155156561160 + 155156561161.
It is an arithmetic number, because the mean of its divisors is an integer number (155156561161).
Almost surely, 2310313122321 is an apocalyptic number.
It is an amenable number.
310313122321 is a deficient number, since it is larger than the sum of its proper divisors (1).
310313122321 is an equidigital number, since it uses as much as digits as its factorization.
310313122321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 310313122321 its reverse (123221313013), we get a palindrome (433534435334).
The spelling of 310313122321 in words is "three hundred ten billion, three hundred thirteen million, one hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •