Base | Representation |
---|---|
bin | 1100100000101… |
… | …0010011111011 |
3 | 10122201210201200 |
4 | 3020022103323 |
5 | 101413033120 |
6 | 5112345243 |
7 | 1204665531 |
oct | 310122373 |
9 | 118653650 |
10 | 52471035 |
11 | 276892a1 |
12 | 156a5223 |
13 | ab42066 |
14 | 6d7c151 |
15 | 4916e90 |
hex | 320a4fb |
52471035 has 24 divisors (see below), whose sum is σ = 92888640. Its totient is φ = 27388032.
The previous prime is 52471031. The next prime is 52471039. The reversal of 52471035 is 53017425.
It is a happy number.
52471035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (52471031) and next prime (52471039).
It is not a de Polignac number, because 52471035 - 22 = 52471031 is a prime.
It is a super-3 number, since 3×524710353 (a number of 24 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (52471031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10290 + ... + 14519.
It is an arithmetic number, because the mean of its divisors is an integer number (3870360).
Almost surely, 252471035 is an apocalyptic number.
52471035 is a deficient number, since it is larger than the sum of its proper divisors (40417605).
52471035 is a wasteful number, since it uses less digits than its factorization.
52471035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24867 (or 24864 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 52471035 is about 7243.6893224378. The cubic root of 52471035 is about 374.3747447283.
The spelling of 52471035 in words is "fifty-two million, four hundred seventy-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •