Base | Representation |
---|---|
bin | 1000110010110000110… |
… | …00000101111001110001 |
3 | 1001212211222200122102222 |
4 | 10121120120011321301 |
5 | 14422230341440421 |
6 | 350444035250425 |
7 | 30554034131336 |
oct | 4313030057161 |
9 | 1055758618388 |
10 | 302130421361 |
11 | 10715082340a |
12 | 4a67aa49a15 |
13 | 2264c30b472 |
14 | 108a206a98d |
15 | 7cd4734cab |
hex | 4658605e71 |
302130421361 has 2 divisors, whose sum is σ = 302130421362. Its totient is φ = 302130421360.
The previous prime is 302130421343. The next prime is 302130421399. The reversal of 302130421361 is 163124031203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 187848562225 + 114281859136 = 433415^2 + 338056^2 .
It is a cyclic number.
It is not a de Polignac number, because 302130421361 - 26 = 302130421297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 302130421361.
It is not a weakly prime, because it can be changed into another prime (302130421661) 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, 151065210680 + 151065210681.
It is an arithmetic number, because the mean of its divisors is an integer number (151065210681).
Almost surely, 2302130421361 is an apocalyptic number.
It is an amenable number.
302130421361 is a deficient number, since it is larger than the sum of its proper divisors (1).
302130421361 is an equidigital number, since it uses as much as digits as its factorization.
302130421361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 302130421361 its reverse (163124031203), we get a palindrome (465254452564).
The spelling of 302130421361 in words is "three hundred two billion, one hundred thirty million, four hundred twenty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •