Base | Representation |
---|---|
bin | 1100101100001… |
… | …0001001010101 |
3 | 10201011001122001 |
4 | 3023002021111 |
5 | 102111132041 |
6 | 5140435301 |
7 | 1214253034 |
oct | 313021125 |
9 | 121131561 |
10 | 53224021 |
11 | 28052aa4 |
12 | 159a8b31 |
13 | b046a06 |
14 | 70d671b |
15 | 4a15131 |
hex | 32c2255 |
53224021 has 2 divisors, whose sum is σ = 53224022. Its totient is φ = 53224020.
The previous prime is 53224013. The next prime is 53224037. The reversal of 53224021 is 12042235.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48860100 + 4363921 = 6990^2 + 2089^2 .
It is a cyclic number.
It is not a de Polignac number, because 53224021 - 23 = 53224013 is a prime.
It is a super-2 number, since 2×532240212 = 5665592822816882, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53224021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53224091) 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, 26612010 + 26612011.
It is an arithmetic number, because the mean of its divisors is an integer number (26612011).
Almost surely, 253224021 is an apocalyptic number.
It is an amenable number.
53224021 is a deficient number, since it is larger than the sum of its proper divisors (1).
53224021 is an equidigital number, since it uses as much as digits as its factorization.
53224021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 53224021 is about 7295.4794907532. The cubic root of 53224021 is about 376.1570685448.
Adding to 53224021 its reverse (12042235), we get a palindrome (65266256).
The spelling of 53224021 in words is "fifty-three million, two hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •