Base | Representation |
---|---|
bin | 1000110010110000110… |
… | …10010011001101000101 |
3 | 1001212212000210001100222 |
4 | 10121120122103031011 |
5 | 14422231014001013 |
6 | 350444055514125 |
7 | 30554042061614 |
oct | 4313032231505 |
9 | 1055760701328 |
10 | 302131000133 |
11 | 107151089236 |
12 | 4a67b088945 |
13 | 2264c481a31 |
14 | 108a217b87b |
15 | 7cd47eb508 |
hex | 4658693345 |
302131000133 has 2 divisors, whose sum is σ = 302131000134. Its totient is φ = 302131000132.
The previous prime is 302131000091. The next prime is 302131000151. The reversal of 302131000133 is 331000131203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 299041641409 + 3089358724 = 546847^2 + 55582^2 .
It is a cyclic number.
It is not a de Polignac number, because 302131000133 - 216 = 302130934597 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (302131000183) 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, 151065500066 + 151065500067.
It is an arithmetic number, because the mean of its divisors is an integer number (151065500067).
Almost surely, 2302131000133 is an apocalyptic number.
It is an amenable number.
302131000133 is a deficient number, since it is larger than the sum of its proper divisors (1).
302131000133 is an equidigital number, since it uses as much as digits as its factorization.
302131000133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 302131000133 its reverse (331000131203), we get a palindrome (633131131336).
The spelling of 302131000133 in words is "three hundred two billion, one hundred thirty-one million, one hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •