Base | Representation |
---|---|
bin | 1000000001100… |
… | …1110011111101 |
3 | 2100100010001111 |
4 | 2000121303331 |
5 | 32104111112 |
6 | 3201242021 |
7 | 556051366 |
oct | 200316375 |
9 | 70303044 |
10 | 33660157 |
11 | 18000413 |
12 | b333311 |
13 | 6c86c6b |
14 | 4682b6d |
15 | 2e4d5a7 |
hex | 2019cfd |
33660157 has 2 divisors, whose sum is σ = 33660158. Its totient is φ = 33660156.
The previous prime is 33660113. The next prime is 33660161. The reversal of 33660157 is 75106633.
33660157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29474041 + 4186116 = 5429^2 + 2046^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33660157 is a prime.
It is a super-2 number, since 2×336601572 = 2266012338529298, which contains 22 as substring.
It is a nialpdrome in base 12.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33640157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16830078 + 16830079.
It is an arithmetic number, because the mean of its divisors is an integer number (16830079).
Almost surely, 233660157 is an apocalyptic number.
It is an amenable number.
33660157 is a deficient number, since it is larger than the sum of its proper divisors (1).
33660157 is an equidigital number, since it uses as much as digits as its factorization.
33660157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 31.
The square root of 33660157 is about 5801.7374121896. The cubic root of 33660157 is about 322.8781918244.
The spelling of 33660157 in words is "thirty-three million, six hundred sixty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •