Base | Representation |
---|---|
bin | 1100110011001… |
… | …0010000001101 |
3 | 10202000101112011 |
4 | 3030302100031 |
5 | 102220330323 |
6 | 5154341221 |
7 | 1221204553 |
oct | 314622015 |
9 | 122011464 |
10 | 53683213 |
11 | 28336aa1 |
12 | 15b8a811 |
13 | b177a1c |
14 | 71b5bd3 |
15 | 4aa620d |
hex | 333240d |
53683213 has 2 divisors, whose sum is σ = 53683214. Its totient is φ = 53683212.
The previous prime is 53683211. The next prime is 53683237. The reversal of 53683213 is 31238635.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51868804 + 1814409 = 7202^2 + 1347^2 .
It is a cyclic number.
It is not a de Polignac number, because 53683213 - 21 = 53683211 is a prime.
Together with 53683211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53683211) 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, 26841606 + 26841607.
It is an arithmetic number, because the mean of its divisors is an integer number (26841607).
Almost surely, 253683213 is an apocalyptic number.
It is an amenable number.
53683213 is a deficient number, since it is larger than the sum of its proper divisors (1).
53683213 is an equidigital number, since it uses as much as digits as its factorization.
53683213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12960, while the sum is 31.
The square root of 53683213 is about 7326.8828979314. The cubic root of 53683213 is about 377.2357415508.
The spelling of 53683213 in words is "fifty-three million, six hundred eighty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.234 sec. • engine limits •