Base | Representation |
---|---|
bin | 1100110011100… |
… | …1000011010001 |
3 | 10202001210201102 |
4 | 3030321003101 |
5 | 102222223212 |
6 | 5155114145 |
7 | 1221352001 |
oct | 314710321 |
9 | 122053642 |
10 | 53711057 |
11 | 28355a04 |
12 | 15ba2955 |
13 | b1875ba |
14 | 71c2001 |
15 | 4aae5c2 |
hex | 33390d1 |
53711057 has 2 divisors, whose sum is σ = 53711058. Its totient is φ = 53711056.
The previous prime is 53711033. The next prime is 53711059. The reversal of 53711057 is 75011735.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43573201 + 10137856 = 6601^2 + 3184^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53711057 is a prime.
Together with 53711059, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p3209933 and since 53711057 and 3209933 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (53711059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26855528 + 26855529.
It is an arithmetic number, because the mean of its divisors is an integer number (26855529).
Almost surely, 253711057 is an apocalyptic number.
It is an amenable number.
53711057 is a deficient number, since it is larger than the sum of its proper divisors (1).
53711057 is an equidigital number, since it uses as much as digits as its factorization.
53711057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3675, while the sum is 29.
The square root of 53711057 is about 7328.7827775150. The cubic root of 53711057 is about 377.3009508650.
The spelling of 53711057 in words is "fifty-three million, seven hundred eleven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •