Base | Representation |
---|---|
bin | 1100110110101… |
… | …0001001001101 |
3 | 10202110000112222 |
4 | 3031222021031 |
5 | 102300142031 |
6 | 5203305125 |
7 | 1223150153 |
oct | 315521115 |
9 | 122400488 |
10 | 53912141 |
11 | 28482a98 |
12 | 1607b1a5 |
13 | b227c9a |
14 | 72353d3 |
15 | 4aede7b |
hex | 336a24d |
53912141 has 2 divisors, whose sum is σ = 53912142. Its totient is φ = 53912140.
The previous prime is 53912137. The next prime is 53912147. The reversal of 53912141 is 14121935.
53912141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 40589641 + 13322500 = 6371^2 + 3650^2 .
It is a cyclic number.
It is not a de Polignac number, because 53912141 - 22 = 53912137 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 53912141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53912147) 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, 26956070 + 26956071.
It is an arithmetic number, because the mean of its divisors is an integer number (26956071).
Almost surely, 253912141 is an apocalyptic number.
It is an amenable number.
53912141 is a deficient number, since it is larger than the sum of its proper divisors (1).
53912141 is an equidigital number, since it uses as much as digits as its factorization.
53912141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1080, while the sum is 26.
The square root of 53912141 is about 7342.4887470121. The cubic root of 53912141 is about 377.7712122049.
The spelling of 53912141 in words is "fifty-three million, nine hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •