Base | Representation |
---|---|
bin | 1100010101110… |
… | …0000001001101 |
3 | 10121101112102212 |
4 | 3011130001031 |
5 | 101222212013 |
6 | 5045200205 |
7 | 1165633301 |
oct | 305340115 |
9 | 117345385 |
10 | 51757133 |
11 | 2724099a |
12 | 15400065 |
13 | a95212c |
14 | 6c33d01 |
15 | 48256a8 |
hex | 315c04d |
51757133 has 2 divisors, whose sum is σ = 51757134. Its totient is φ = 51757132.
The previous prime is 51757127. The next prime is 51757157. The reversal of 51757133 is 33175715.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27175369 + 24581764 = 5213^2 + 4958^2 .
It is a cyclic number.
It is not a de Polignac number, because 51757133 - 216 = 51691597 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 51757133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51757103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25878566 + 25878567.
It is an arithmetic number, because the mean of its divisors is an integer number (25878567).
Almost surely, 251757133 is an apocalyptic number.
It is an amenable number.
51757133 is a deficient number, since it is larger than the sum of its proper divisors (1).
51757133 is an equidigital number, since it uses as much as digits as its factorization.
51757133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11025, while the sum is 32.
The square root of 51757133 is about 7194.2430456581. The cubic root of 51757133 is about 372.6691164884.
The spelling of 51757133 in words is "fifty-one million, seven hundred fifty-seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •