Base | Representation |
---|---|
bin | 1100100011011… |
… | …1000000111101 |
3 | 10200002002220101 |
4 | 3020313000331 |
5 | 101434413031 |
6 | 5120321101 |
7 | 1206360421 |
oct | 310670075 |
9 | 120062811 |
10 | 52654141 |
11 | 277a3921 |
12 | 15773191 |
13 | aba74c7 |
14 | 6dc8b81 |
15 | 4951361 |
hex | 323703d |
52654141 has 2 divisors, whose sum is σ = 52654142. Its totient is φ = 52654140.
The previous prime is 52654139. The next prime is 52654157. The reversal of 52654141 is 14145625.
52654141 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., 46172025 + 6482116 = 6795^2 + 2546^2 .
It is a cyclic number.
It is not a de Polignac number, because 52654141 - 21 = 52654139 is a prime.
Together with 52654139, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52654741) 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, 26327070 + 26327071.
It is an arithmetic number, because the mean of its divisors is an integer number (26327071).
Almost surely, 252654141 is an apocalyptic number.
It is an amenable number.
52654141 is a deficient number, since it is larger than the sum of its proper divisors (1).
52654141 is an equidigital number, since it uses as much as digits as its factorization.
52654141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4800, while the sum is 28.
The square root of 52654141 is about 7256.3173166559. The cubic root of 52654141 is about 374.8097191686.
Adding to 52654141 its reverse (14145625), we get a palindrome (66799766).
The spelling of 52654141 in words is "fifty-two million, six hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •