Base | Representation |
---|---|
bin | 1100011010011… |
… | …0111111010111 |
3 | 10121222010200021 |
4 | 3012212333113 |
5 | 101312023330 |
6 | 5055530011 |
7 | 1201352500 |
oct | 306467727 |
9 | 117863607 |
10 | 52064215 |
11 | 27430685 |
12 | 15529907 |
13 | aa2bb38 |
14 | 6cb3ba7 |
15 | 488667a |
hex | 31a6fd7 |
52064215 has 12 divisors (see below), whose sum is σ = 72677736. Its totient is φ = 35701008.
The previous prime is 52064209. The next prime is 52064231. The reversal of 52064215 is 51246025.
It is not a de Polignac number, because 52064215 - 29 = 52063703 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52064215.
It is a congruent number.
It is an unprimeable number.
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, 106009 + ... + 106498.
It is an arithmetic number, because the mean of its divisors is an integer number (6056478).
Almost surely, 252064215 is an apocalyptic number.
52064215 is a deficient number, since it is larger than the sum of its proper divisors (20613521).
52064215 is a wasteful number, since it uses less digits than its factorization.
52064215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212526 (or 212519 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 52064215 is about 7215.5536863085. The cubic root of 52064215 is about 373.4046955597.
The spelling of 52064215 in words is "fifty-two million, sixty-four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •