Base | Representation |
---|---|
bin | 1100101001101… |
… | …1101111110101 |
3 | 10200212001212212 |
4 | 3022123233311 |
5 | 102041113431 |
6 | 5133223205 |
7 | 1213026350 |
oct | 312335765 |
9 | 120761785 |
10 | 53066741 |
11 | 27a55912 |
12 | 15931b05 |
13 | acc0250 |
14 | 7095297 |
15 | 49d372b |
hex | 329bbf5 |
53066741 has 16 divisors (see below), whose sum is σ = 69156864. Its totient is φ = 39515904.
The previous prime is 53066731. The next prime is 53066743. The reversal of 53066741 is 14766035.
It is a cyclic number.
It is not a de Polignac number, because 53066741 - 222 = 48872437 is a prime.
It is a super-2 number, since 2×530667412 = 5632158000722162, which contains 22 as substring.
It is a Smith number, since the sum of its digits (32) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 53066698 and 53066707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53066743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15605 + ... + 18698.
It is an arithmetic number, because the mean of its divisors is an integer number (4322304).
Almost surely, 253066741 is an apocalyptic number.
It is an amenable number.
53066741 is a deficient number, since it is larger than the sum of its proper divisors (16090123).
53066741 is a wasteful number, since it uses less digits than its factorization.
53066741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34340.
The product of its (nonzero) digits is 15120, while the sum is 32.
The square root of 53066741 is about 7284.6922378368. The cubic root of 53066741 is about 375.7861811512.
The spelling of 53066741 in words is "fifty-three million, sixty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •