Base | Representation |
---|---|
bin | 1100011100001… |
… | …1110010001101 |
3 | 10122012010110111 |
4 | 3013003302031 |
5 | 101324312112 |
6 | 5102240021 |
7 | 1202353366 |
oct | 307036215 |
9 | 118163414 |
10 | 52182157 |
11 | 27501255 |
12 | 15586011 |
13 | aa70721 |
14 | 6d04b6d |
15 | 48ab5a7 |
hex | 31c3c8d |
52182157 has 8 divisors (see below), whose sum is σ = 53643384. Its totient is φ = 50738688.
The previous prime is 52182133. The next prime is 52182167. The reversal of 52182157 is 75128125.
52182157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 11464996 + 40717161 = 3386^2 + 6381^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52182157 - 27 = 52182029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52182167) 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 7 ways as a sum of consecutive naturals, for example, 1633 + ... + 10345.
It is an arithmetic number, because the mean of its divisors is an integer number (6705423).
Almost surely, 252182157 is an apocalyptic number.
It is an amenable number.
52182157 is a deficient number, since it is larger than the sum of its proper divisors (1461227).
52182157 is a wasteful number, since it uses less digits than its factorization.
52182157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8879.
The product of its digits is 5600, while the sum is 31.
The square root of 52182157 is about 7223.7218246552. The cubic root of 52182157 is about 373.6864430354.
The spelling of 52182157 in words is "fifty-two million, one hundred eighty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •