Base | Representation |
---|---|
bin | 1100011111101… |
… | …0100101101111 |
3 | 10122121112101122 |
4 | 3013322211233 |
5 | 101404003024 |
6 | 5111131155 |
7 | 1204310015 |
oct | 307724557 |
9 | 118545348 |
10 | 52406639 |
11 | 2764497a |
12 | 15673abb |
13 | ab1b95c |
14 | 6d628b5 |
15 | 4902d5e |
hex | 31fa96f |
52406639 has 4 divisors (see below), whose sum is σ = 52421424. Its totient is φ = 52391856.
The previous prime is 52406633. The next prime is 52406687. The reversal of 52406639 is 93660425.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 52406639 - 28 = 52406383 is a prime.
It is a super-2 number, since 2×524066392 = 5492911622552642, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52406599 and 52406608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52406633) 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 3 ways as a sum of consecutive naturals, for example, 1454 + ... + 10340.
It is an arithmetic number, because the mean of its divisors is an integer number (13105356).
Almost surely, 252406639 is an apocalyptic number.
52406639 is a deficient number, since it is larger than the sum of its proper divisors (14785).
52406639 is an equidigital number, since it uses as much as digits as its factorization.
52406639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14784.
The product of its (nonzero) digits is 38880, while the sum is 35.
The square root of 52406639 is about 7239.2429852851. The cubic root of 52406639 is about 374.2215293705.
The spelling of 52406639 in words is "fifty-two million, four hundred six thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •