Base | Representation |
---|---|
bin | 1100100000011… |
… | …0111100110011 |
3 | 10122201002211202 |
4 | 3020012330303 |
5 | 101412113032 |
6 | 5112201415 |
7 | 1204610432 |
oct | 310067463 |
9 | 118632752 |
10 | 52457267 |
11 | 27679a15 |
12 | 1569926b |
13 | ab38a05 |
14 | 6d77119 |
15 | 4912d62 |
hex | 3206f33 |
52457267 has 2 divisors, whose sum is σ = 52457268. Its totient is φ = 52457266.
The previous prime is 52457263. The next prime is 52457269. The reversal of 52457267 is 76275425.
It is a happy number.
52457267 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 not a de Polignac number, because 52457267 - 22 = 52457263 is a prime.
It is a super-2 number, since 2×524572672 = 5503529722218578, which contains 22 as substring.
Together with 52457269, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52457267.
It is not a weakly prime, because it can be changed into another prime (52457263) 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, 26228633 + 26228634.
It is an arithmetic number, because the mean of its divisors is an integer number (26228634).
Almost surely, 252457267 is an apocalyptic number.
52457267 is a deficient number, since it is larger than the sum of its proper divisors (1).
52457267 is an equidigital number, since it uses as much as digits as its factorization.
52457267 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 117600, while the sum is 38.
The square root of 52457267 is about 7242.7389156313. The cubic root of 52457267 is about 374.3419975033.
The spelling of 52457267 in words is "fifty-two million, four hundred fifty-seven thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •