Base | Representation |
---|---|
bin | 10011110010100… |
… | …001001001000101 |
3 | 212010201212011122 |
4 | 103302201021011 |
5 | 1134443310203 |
6 | 52540043325 |
7 | 11141016224 |
oct | 2362411105 |
9 | 763655148 |
10 | 332010053 |
11 | 160458081 |
12 | 93233545 |
13 | 53a2796b |
14 | 32146cbb |
15 | 1e233538 |
hex | 13ca1245 |
332010053 has 2 divisors, whose sum is σ = 332010054. Its totient is φ = 332010052.
The previous prime is 332010001. The next prime is 332010079. The reversal of 332010053 is 350010233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 311416609 + 20593444 = 17647^2 + 4538^2 .
It is an emirp because it is prime and its reverse (350010233) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 332010053 - 26 = 332009989 is a prime.
It is a super-2 number, since 2×3320100532 = 220461350586125618, which contains 22 as substring.
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 (332010253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166005026 + 166005027.
It is an arithmetic number, because the mean of its divisors is an integer number (166005027).
Almost surely, 2332010053 is an apocalyptic number.
It is an amenable number.
332010053 is a deficient number, since it is larger than the sum of its proper divisors (1).
332010053 is an equidigital number, since it uses as much as digits as its factorization.
332010053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 270, while the sum is 17.
The square root of 332010053 is about 18221.1430212267. The cubic root of 332010053 is about 692.4425462029.
Adding to 332010053 its reverse (350010233), we get a palindrome (682020286).
The spelling of 332010053 in words is "three hundred thirty-two million, ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •