Base | Representation |
---|---|
bin | 1000110000101101110… |
… | …01111100101010000101 |
3 | 1001210000102211001210021 |
4 | 10120112321330222011 |
5 | 14413003143001013 |
6 | 350143040255141 |
7 | 30514565532154 |
oct | 4302671745205 |
9 | 1053012731707 |
10 | 301032000133 |
11 | 106737797277 |
12 | 4a4130114b1 |
13 | 22505891287 |
14 | 107da21d59b |
15 | 7c6d0b1a8d |
hex | 4616e7ca85 |
301032000133 has 2 divisors, whose sum is σ = 301032000134. Its totient is φ = 301032000132.
The previous prime is 301032000119. The next prime is 301032000211. The reversal of 301032000133 is 331000230103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 271798523649 + 29233476484 = 521343^2 + 170978^2 .
It is an emirp because it is prime and its reverse (331000230103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 301032000133 - 233 = 292442065541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (301032000103) 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, 150516000066 + 150516000067.
It is an arithmetic number, because the mean of its divisors is an integer number (150516000067).
Almost surely, 2301032000133 is an apocalyptic number.
It is an amenable number.
301032000133 is a deficient number, since it is larger than the sum of its proper divisors (1).
301032000133 is an equidigital number, since it uses as much as digits as its factorization.
301032000133 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 16.
Adding to 301032000133 its reverse (331000230103), we get a palindrome (632032230236).
The spelling of 301032000133 in words is "three hundred one billion, thirty-two million, one hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •