Base | Representation |
---|---|
bin | 1100011010001… |
… | …0011000110001 |
3 | 10121221011210222 |
4 | 3012202120301 |
5 | 101310422421 |
6 | 5055302425 |
7 | 1201243514 |
oct | 306423061 |
9 | 117834728 |
10 | 52045361 |
11 | 274184a5 |
12 | 1551aa15 |
13 | aa23394 |
14 | 6caad7b |
15 | 4880cab |
hex | 31a2631 |
52045361 has 2 divisors, whose sum is σ = 52045362. Its totient is φ = 52045360.
The previous prime is 52045349. The next prime is 52045363. The reversal of 52045361 is 16354025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42706225 + 9339136 = 6535^2 + 3056^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52045361 is a prime.
Together with 52045363, 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 52045361.
It is not a weakly prime, because it can be changed into another prime (52045363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26022680 + 26022681.
It is an arithmetic number, because the mean of its divisors is an integer number (26022681).
Almost surely, 252045361 is an apocalyptic number.
It is an amenable number.
52045361 is a deficient number, since it is larger than the sum of its proper divisors (1).
52045361 is an equidigital number, since it uses as much as digits as its factorization.
52045361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 52045361 is about 7214.2470847622. The cubic root of 52045361 is about 373.3596164709.
Adding to 52045361 its reverse (16354025), we get a palindrome (68399386).
The spelling of 52045361 in words is "fifty-two million, forty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •