Base | Representation |
---|---|
bin | 1100100001110… |
… | …0110110001101 |
3 | 10122212122212121 |
4 | 3020130312031 |
5 | 101423000312 |
6 | 5114132541 |
7 | 1205433061 |
oct | 310346615 |
9 | 118778777 |
10 | 52546957 |
11 | 27730341 |
12 | 15721151 |
13 | ab6a798 |
14 | 6d9baa1 |
15 | 492e707 |
hex | 321cd8d |
52546957 has 2 divisors, whose sum is σ = 52546958. Its totient is φ = 52546956.
The previous prime is 52546931. The next prime is 52546969. The reversal of 52546957 is 75964525.
52546957 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., 43480836 + 9066121 = 6594^2 + 3011^2 .
It is a cyclic number.
It is not a de Polignac number, because 52546957 - 223 = 44158349 is a prime.
It is a super-2 number, since 2×525469572 = 5522365379919698, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52546997) 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, 26273478 + 26273479.
It is an arithmetic number, because the mean of its divisors is an integer number (26273479).
Almost surely, 252546957 is an apocalyptic number.
It is an amenable number.
52546957 is a deficient number, since it is larger than the sum of its proper divisors (1).
52546957 is an equidigital number, since it uses as much as digits as its factorization.
52546957 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 378000, while the sum is 43.
The square root of 52546957 is about 7248.9279897099. The cubic root of 52546957 is about 374.5552225960. Note that the first 3 decimals are identical.
The spelling of 52546957 in words is "fifty-two million, five hundred forty-six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •