Base | Representation |
---|---|
bin | 1100101001000… |
… | …0101101001001 |
3 | 10200202202211202 |
4 | 3022100231021 |
5 | 102033142023 |
6 | 5132233545 |
7 | 1212450446 |
oct | 312205511 |
9 | 120682752 |
10 | 53021513 |
11 | 27a24936 |
12 | 1590b8b5 |
13 | aca579c |
14 | 70829cd |
15 | 49c5128 |
hex | 3290b49 |
53021513 has 2 divisors, whose sum is σ = 53021514. Its totient is φ = 53021512.
The previous prime is 53021503. The next prime is 53021543. The reversal of 53021513 is 31512035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49168144 + 3853369 = 7012^2 + 1963^2 .
It is a cyclic number.
It is not a de Polignac number, because 53021513 - 24 = 53021497 is a prime.
It is a super-2 number, since 2×530215132 = 5622561681618338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (53021503) 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, 26510756 + 26510757.
It is an arithmetic number, because the mean of its divisors is an integer number (26510757).
Almost surely, 253021513 is an apocalyptic number.
It is an amenable number.
53021513 is a deficient number, since it is larger than the sum of its proper divisors (1).
53021513 is an equidigital number, since it uses as much as digits as its factorization.
53021513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 53021513 is about 7281.5872582837. The cubic root of 53021513 is about 375.6793918022.
Adding to 53021513 its reverse (31512035), we get a palindrome (84533548).
The spelling of 53021513 in words is "fifty-three million, twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •