Base | Representation |
---|---|
bin | 1000110010110000110… |
… | …00001000000101101001 |
3 | 1001212211222201002201112 |
4 | 10121120120020011221 |
5 | 14422230342232223 |
6 | 350444035400105 |
7 | 30554034166415 |
oct | 4313030100551 |
9 | 1055758632645 |
10 | 302130430313 |
11 | 10715082a108 |
12 | 4a67aa53035 |
13 | 2264c31256a |
14 | 108a206dd45 |
15 | 7cd4737778 |
hex | 4658608169 |
302130430313 has 2 divisors, whose sum is σ = 302130430314. Its totient is φ = 302130430312.
The previous prime is 302130430289. The next prime is 302130430417. The reversal of 302130430313 is 313034031203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 249693094249 + 52437336064 = 499693^2 + 228992^2 .
It is an emirp because it is prime and its reverse (313034031203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 302130430313 - 212 = 302130426217 is a prime.
It is a super-2 number, since 2×3021304303132 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (302130430013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151065215156 + 151065215157.
It is an arithmetic number, because the mean of its divisors is an integer number (151065215157).
Almost surely, 2302130430313 is an apocalyptic number.
It is an amenable number.
302130430313 is a deficient number, since it is larger than the sum of its proper divisors (1).
302130430313 is an equidigital number, since it uses as much as digits as its factorization.
302130430313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 302130430313 its reverse (313034031203), we get a palindrome (615164461516).
The spelling of 302130430313 in words is "three hundred two billion, one hundred thirty million, four hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •