Base | Representation |
---|---|
bin | 1100011100111… |
… | …0000110110001 |
3 | 10122021021110021 |
4 | 3013032012301 |
5 | 101332140213 |
6 | 5103203441 |
7 | 1202620552 |
oct | 307160661 |
9 | 118237407 |
10 | 52224433 |
11 | 2752aa98 |
12 | 155a6581 |
13 | aa86a41 |
14 | 6d16329 |
15 | 48b8d8d |
hex | 31ce1b1 |
52224433 has 2 divisors, whose sum is σ = 52224434. Its totient is φ = 52224432.
The previous prime is 52224413. The next prime is 52224461. The reversal of 52224433 is 33442225.
52224433 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., 33837489 + 18386944 = 5817^2 + 4288^2 .
It is a cyclic number.
It is not a de Polignac number, because 52224433 - 25 = 52224401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52224398 and 52224407.
It is not a weakly prime, because it can be changed into another prime (52224413) 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, 26112216 + 26112217.
It is an arithmetic number, because the mean of its divisors is an integer number (26112217).
Almost surely, 252224433 is an apocalyptic number.
It is an amenable number.
52224433 is a deficient number, since it is larger than the sum of its proper divisors (1).
52224433 is an equidigital number, since it uses as much as digits as its factorization.
52224433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5760, while the sum is 25.
The square root of 52224433 is about 7226.6474246361. The cubic root of 52224433 is about 373.7873313121.
Adding to 52224433 its reverse (33442225), we get a palindrome (85666658).
The spelling of 52224433 in words is "fifty-two million, two hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •