Base | Representation |
---|---|
bin | 1100011110110… |
… | …0001011010001 |
3 | 10122111112102001 |
4 | 3013230023101 |
5 | 101400110401 |
6 | 5105554001 |
7 | 1203642625 |
oct | 307541321 |
9 | 118445361 |
10 | 52347601 |
11 | 27604589 |
12 | 15645901 |
13 | aacab17 |
14 | 6d49185 |
15 | 48e0601 |
hex | 31ec2d1 |
52347601 has 2 divisors, whose sum is σ = 52347602. Its totient is φ = 52347600.
The previous prime is 52347599. The next prime is 52347619. The reversal of 52347601 is 10674325.
52347601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31371201 + 20976400 = 5601^2 + 4580^2 .
It is a cyclic number.
It is not a de Polignac number, because 52347601 - 21 = 52347599 is a prime.
Together with 52347599, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 52347601.
It is not a weakly prime, because it can be changed into another prime (52347401) 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, 26173800 + 26173801.
It is an arithmetic number, because the mean of its divisors is an integer number (26173801).
Almost surely, 252347601 is an apocalyptic number.
It is an amenable number.
52347601 is a deficient number, since it is larger than the sum of its proper divisors (1).
52347601 is an equidigital number, since it uses as much as digits as its factorization.
52347601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 52347601 is about 7235.1641999335. The cubic root of 52347601 is about 374.0809518116.
The spelling of 52347601 in words is "fifty-two million, three hundred forty-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •