Base | Representation |
---|---|
bin | 10010011110110… |
… | …001010001011101 |
3 | 210121102110220122 |
4 | 102132301101131 |
5 | 1113333243104 |
6 | 50433324325 |
7 | 10453301303 |
oct | 2236612135 |
9 | 717373818 |
10 | 310056029 |
11 | 14a022758 |
12 | 87a066a5 |
13 | 4c30c00a |
14 | 2d270273 |
15 | 1c3486be |
hex | 127b145d |
310056029 has 2 divisors, whose sum is σ = 310056030. Its totient is φ = 310056028.
The previous prime is 310055971. The next prime is 310056053. The reversal of 310056029 is 920650013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 309830404 + 225625 = 17602^2 + 475^2 .
It is an emirp because it is prime and its reverse (920650013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 310056029 - 28 = 310055773 is a prime.
It is a super-3 number, since 3×3100560293 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 310055989 and 310056007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (310058029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155028014 + 155028015.
It is an arithmetic number, because the mean of its divisors is an integer number (155028015).
Almost surely, 2310056029 is an apocalyptic number.
It is an amenable number.
310056029 is a deficient number, since it is larger than the sum of its proper divisors (1).
310056029 is an equidigital number, since it uses as much as digits as its factorization.
310056029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 310056029 is about 17608.4079064520. The cubic root of 310056029 is about 676.8307168016.
The spelling of 310056029 in words is "three hundred ten million, fifty-six thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •