Base | Representation |
---|---|
bin | 1100100100000… |
… | …0111111100011 |
3 | 10200011011222002 |
4 | 3021000333203 |
5 | 101442220021 |
6 | 5121234215 |
7 | 1206620525 |
oct | 311007743 |
9 | 120134862 |
10 | 52695011 |
11 | 278215a6 |
12 | 1579296b |
13 | abbcca5 |
14 | 6dd9a15 |
15 | 495d50b |
hex | 3240fe3 |
52695011 has 2 divisors, whose sum is σ = 52695012. Its totient is φ = 52695010.
The previous prime is 52694981. The next prime is 52695017. The reversal of 52695011 is 11059625.
52695011 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52695011 is a prime.
It is not a weakly prime, because it can be changed into another prime (52695017) 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, 26347505 + 26347506.
It is an arithmetic number, because the mean of its divisors is an integer number (26347506).
Almost surely, 252695011 is an apocalyptic number.
52695011 is a deficient number, since it is larger than the sum of its proper divisors (1).
52695011 is an equidigital number, since it uses as much as digits as its factorization.
52695011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 29.
The square root of 52695011 is about 7259.1329372040. The cubic root of 52695011 is about 374.9066695145.
The spelling of 52695011 in words is "fifty-two million, six hundred ninety-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •