Base | Representation |
---|---|
bin | 11111001110101110… |
… | …101111010110100101 |
3 | 10012112222111111210022 |
4 | 133032232233112211 |
5 | 1022133440131044 |
6 | 23223243204525 |
7 | 2264660621561 |
oct | 371656572645 |
9 | 105488444708 |
10 | 33533130149 |
11 | 1324863a002 |
12 | 65ba216745 |
13 | 321536135c |
14 | 18a178c6a1 |
15 | d13dcc3ee |
hex | 7cebaf5a5 |
33533130149 has 2 divisors, whose sum is σ = 33533130150. Its totient is φ = 33533130148.
The previous prime is 33533130047. The next prime is 33533130151. The reversal of 33533130149 is 94103133533.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32118016225 + 1415113924 = 179215^2 + 37618^2 .
It is a cyclic number.
It is not a de Polignac number, because 33533130149 - 28 = 33533129893 is a prime.
It is a super-2 number, since 2×335331301492 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 33533130151, it forms a pair of twin primes.
It is a Chen 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 (33533130349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16766565074 + 16766565075.
It is an arithmetic number, because the mean of its divisors is an integer number (16766565075).
Almost surely, 233533130149 is an apocalyptic number.
It is an amenable number.
33533130149 is a deficient number, since it is larger than the sum of its proper divisors (1).
33533130149 is an equidigital number, since it uses as much as digits as its factorization.
33533130149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 35.
The spelling of 33533130149 in words is "thirty-three billion, five hundred thirty-three million, one hundred thirty thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •