Base | Representation |
---|---|
bin | 1001000010000000010… |
… | …11111010101111000101 |
3 | 1002122222100111111021012 |
4 | 10201000023322233011 |
5 | 20041011003330201 |
6 | 354320112532005 |
7 | 31263611553014 |
oct | 4410013725705 |
9 | 1078870444235 |
10 | 310314511301 |
11 | 10a6704a7303 |
12 | 50183851005 |
13 | 23354a27c32 |
14 | 1103ad74a7b |
15 | 8112e955bb |
hex | 48402fabc5 |
310314511301 has 2 divisors, whose sum is σ = 310314511302. Its totient is φ = 310314511300.
The previous prime is 310314511267. The next prime is 310314511303. The reversal of 310314511301 is 103115413013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 174632052100 + 135682459201 = 417890^2 + 368351^2 .
It is a cyclic number.
It is not a de Polignac number, because 310314511301 - 210 = 310314510277 is a prime.
Together with 310314511303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (310314511303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155157255650 + 155157255651.
It is an arithmetic number, because the mean of its divisors is an integer number (155157255651).
Almost surely, 2310314511301 is an apocalyptic number.
It is an amenable number.
310314511301 is a deficient number, since it is larger than the sum of its proper divisors (1).
310314511301 is an equidigital number, since it uses as much as digits as its factorization.
310314511301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 310314511301 its reverse (103115413013), we get a palindrome (413429924314).
The spelling of 310314511301 in words is "three hundred ten billion, three hundred fourteen million, five hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •