Base | Representation |
---|---|
bin | 1100100011001… |
… | …1111011111101 |
3 | 10200001110121102 |
4 | 3020303323331 |
5 | 101434012113 |
6 | 5120142445 |
7 | 1206305600 |
oct | 310637375 |
9 | 120043542 |
10 | 52641533 |
11 | 277953aa |
12 | 15767a25 |
13 | aba1849 |
14 | 6dc4337 |
15 | 494c758 |
hex | 3233efd |
52641533 has 12 divisors (see below), whose sum is σ = 64460160. Its totient is φ = 42745752.
The previous prime is 52641521. The next prime is 52641553. The reversal of 52641533 is 33514625.
It is not a de Polignac number, because 52641533 - 24 = 52641517 is a prime.
It is a super-2 number, since 2×526415332 = 5542261993180178, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 52641496 and 52641505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52641553) 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 11 ways as a sum of consecutive naturals, for example, 27341 + ... + 29202.
It is an arithmetic number, because the mean of its divisors is an integer number (5371680).
Almost surely, 252641533 is an apocalyptic number.
It is an amenable number.
52641533 is a deficient number, since it is larger than the sum of its proper divisors (11818627).
52641533 is a wasteful number, since it uses less digits than its factorization.
52641533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56576 (or 56569 counting only the distinct ones).
The product of its digits is 10800, while the sum is 29.
The square root of 52641533 is about 7255.4485044000. The cubic root of 52641533 is about 374.7798007989.
The spelling of 52641533 in words is "fifty-two million, six hundred forty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •