Base | Representation |
---|---|
bin | 1100110100111… |
… | …0100110010001 |
3 | 10202020021210011 |
4 | 3031032212101 |
5 | 102233034223 |
6 | 5201034521 |
7 | 1222200211 |
oct | 315164621 |
9 | 122207704 |
10 | 53799313 |
11 | 28406247 |
12 | 16025a41 |
13 | b1b8819 |
14 | 7206241 |
15 | 4aca80d |
hex | 334e991 |
53799313 has 2 divisors, whose sum is σ = 53799314. Its totient is φ = 53799312.
The previous prime is 53799311. The next prime is 53799331. The reversal of 53799313 is 31399735.
53799313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (53799331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38526849 + 15272464 = 6207^2 + 3908^2 .
It is a cyclic number.
It is not a de Polignac number, because 53799313 - 21 = 53799311 is a prime.
Together with 53799311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (53799311) 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, 26899656 + 26899657.
It is an arithmetic number, because the mean of its divisors is an integer number (26899657).
Almost surely, 253799313 is an apocalyptic number.
It is an amenable number.
53799313 is a deficient number, since it is larger than the sum of its proper divisors (1).
53799313 is an equidigital number, since it uses as much as digits as its factorization.
53799313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 76545, while the sum is 40.
The square root of 53799313 is about 7334.8014969732. The cubic root of 53799313 is about 377.5074933822.
The spelling of 53799313 in words is "fifty-three million, seven hundred ninety-nine thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •