Base | Representation |
---|---|
bin | 1000110011000110100… |
… | …00101001101001111101 |
3 | 1001220022201021121201121 |
4 | 10121203100221221331 |
5 | 14423114113120104 |
6 | 350514121110541 |
7 | 30561412162066 |
oct | 4314320515175 |
9 | 1056281247647 |
10 | 302313020029 |
11 | 1072349004a9 |
12 | 4a710028451 |
13 | 2267b0b2107 |
14 | 108bc3dd56d |
15 | 7ce57a3254 |
hex | 4663429a7d |
302313020029 has 2 divisors, whose sum is σ = 302313020030. Its totient is φ = 302313020028.
The previous prime is 302313020017. The next prime is 302313020111. The reversal of 302313020029 is 920020313203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 299895331129 + 2417688900 = 547627^2 + 49170^2 .
It is an emirp because it is prime and its reverse (920020313203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 302313020029 - 25 = 302313019997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 302313019985 and 302313020012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (302313020729) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151156510014 + 151156510015.
It is an arithmetic number, because the mean of its divisors is an integer number (151156510015).
Almost surely, 2302313020029 is an apocalyptic number.
It is an amenable number.
302313020029 is a deficient number, since it is larger than the sum of its proper divisors (1).
302313020029 is an equidigital number, since it uses as much as digits as its factorization.
302313020029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
The spelling of 302313020029 in words is "three hundred two billion, three hundred thirteen million, twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •