Base | Representation |
---|---|
bin | 1100011111100… |
… | …0010100010101 |
3 | 10122121001121222 |
4 | 3013320110111 |
5 | 101403203313 |
6 | 5111020125 |
7 | 1204240622 |
oct | 307702425 |
9 | 118531558 |
10 | 52397333 |
11 | 2763898a |
12 | 1566a645 |
13 | ab17651 |
14 | 6d5d349 |
15 | 4900208 |
hex | 31f8515 |
52397333 has 2 divisors, whose sum is σ = 52397334. Its totient is φ = 52397332.
The previous prime is 52397321. The next prime is 52397341. The reversal of 52397333 is 33379325.
52397333 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., 51868804 + 528529 = 7202^2 + 727^2 .
It is a cyclic number.
It is not a de Polignac number, because 52397333 - 220 = 51348757 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 52397293 and 52397302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52397393) 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, 26198666 + 26198667.
It is an arithmetic number, because the mean of its divisors is an integer number (26198667).
Almost surely, 252397333 is an apocalyptic number.
It is an amenable number.
52397333 is a deficient number, since it is larger than the sum of its proper divisors (1).
52397333 is an equidigital number, since it uses as much as digits as its factorization.
52397333 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51030, while the sum is 35.
The square root of 52397333 is about 7238.6002099854. The cubic root of 52397333 is about 374.1993775225.
The spelling of 52397333 in words is "fifty-two million, three hundred ninety-seven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •