Base | Representation |
---|---|
bin | 1100110110100… |
… | …1101010010001 |
3 | 10202102220211122 |
4 | 3031221222101 |
5 | 102300111121 |
6 | 5203252025 |
7 | 1223141324 |
oct | 315515221 |
9 | 122386748 |
10 | 53910161 |
11 | 28481558 |
12 | 1607a015 |
13 | b227106 |
14 | 72347bb |
15 | 4aed5ab |
hex | 3369a91 |
53910161 has 2 divisors, whose sum is σ = 53910162. Its totient is φ = 53910160.
The previous prime is 53910151. The next prime is 53910167. The reversal of 53910161 is 16101935.
53910161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43151761 + 10758400 = 6569^2 + 3280^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53910161 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53910161.
It is not a weakly prime, because it can be changed into another prime (53910167) 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, 26955080 + 26955081.
It is an arithmetic number, because the mean of its divisors is an integer number (26955081).
Almost surely, 253910161 is an apocalyptic number.
It is an amenable number.
53910161 is a deficient number, since it is larger than the sum of its proper divisors (1).
53910161 is an equidigital number, since it uses as much as digits as its factorization.
53910161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 26.
The square root of 53910161 is about 7342.3539141068. The cubic root of 53910161 is about 377.7665874200.
The spelling of 53910161 in words is "fifty-three million, nine hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •