Base | Representation |
---|---|
bin | 1000110010110001000… |
… | …01111011100000101001 |
3 | 1001212212011112122222202 |
4 | 10121120201323200221 |
5 | 14422232022001413 |
6 | 350444210425545 |
7 | 30554065062041 |
oct | 4313041734051 |
9 | 1055764478882 |
10 | 302133000233 |
11 | 107152224a09 |
12 | 4a67b8922b5 |
13 | 2264ca0221c |
14 | 108a253c721 |
15 | 7cd4a93e58 |
hex | 465887b829 |
302133000233 has 2 divisors, whose sum is σ = 302133000234. Its totient is φ = 302133000232.
The previous prime is 302133000173. The next prime is 302133000241. The reversal of 302133000233 is 332000331203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 166294315264 + 135838684969 = 407792^2 + 368563^2 .
It is an emirp because it is prime and its reverse (332000331203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 302133000233 - 28 = 302132999977 is a prime.
It is not a weakly prime, because it can be changed into another prime (302133005233) 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, 151066500116 + 151066500117.
It is an arithmetic number, because the mean of its divisors is an integer number (151066500117).
Almost surely, 2302133000233 is an apocalyptic number.
It is an amenable number.
302133000233 is a deficient number, since it is larger than the sum of its proper divisors (1).
302133000233 is an equidigital number, since it uses as much as digits as its factorization.
302133000233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 20.
Adding to 302133000233 its reverse (332000331203), we get a palindrome (634133331436).
The spelling of 302133000233 in words is "three hundred two billion, one hundred thirty-three million, two hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •