Base | Representation |
---|---|
bin | 1100011001101… |
… | …1011000000001 |
3 | 10121212201102021 |
4 | 3012123120001 |
5 | 101304013031 |
6 | 5054521441 |
7 | 1201064005 |
oct | 306333001 |
9 | 117781367 |
10 | 52016641 |
11 | 273a8966 |
12 | 15506281 |
13 | aa132a1 |
14 | 6ca0705 |
15 | 4877511 |
hex | 319b601 |
52016641 has 4 divisors (see below), whose sum is σ = 52040772. Its totient is φ = 51992512.
The previous prime is 52016621. The next prime is 52016683. The reversal of 52016641 is 14661025.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1904400 + 50112241 = 1380^2 + 7079^2 .
It is a cyclic number.
It is not a de Polignac number, because 52016641 - 213 = 52008449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52016611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8476 + ... + 13261.
It is an arithmetic number, because the mean of its divisors is an integer number (13010193).
Almost surely, 252016641 is an apocalyptic number.
It is an amenable number.
52016641 is a deficient number, since it is larger than the sum of its proper divisors (24131).
52016641 is a wasteful number, since it uses less digits than its factorization.
52016641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24130.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 52016641 is about 7212.2563043752. The cubic root of 52016641 is about 373.2909272802.
Adding to 52016641 its reverse (14661025), we get a palindrome (66677666).
It can be divided in two parts, 520 and 16641, that added together give a square (17161 = 1312).
The spelling of 52016641 in words is "fifty-two million, sixteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •