Base | Representation |
---|---|
bin | 1100100001001… |
… | …0111010011011 |
3 | 10122210121001120 |
4 | 3020102322123 |
5 | 101420200032 |
6 | 5113220323 |
7 | 1205203332 |
oct | 310227233 |
9 | 118717046 |
10 | 52506267 |
11 | 27702810 |
12 | 157016a3 |
13 | ab550c8 |
14 | 6d8ad19 |
15 | 492262c |
hex | 3212e9b |
52506267 has 8 divisors (see below), whose sum is σ = 76372800. Its totient is φ = 31821960.
The previous prime is 52506257. The next prime is 52506271. The reversal of 52506267 is 76260525.
52506267 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52506267 - 26 = 52506203 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 1591099 = 52506267 / (5 + 2 + 5 + 0 + 6 + 2 + 6 + 7).
It is not an unprimeable number, because it can be changed into a prime (52506247) 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, 795517 + ... + 795582.
It is an arithmetic number, because the mean of its divisors is an integer number (9546600).
Almost surely, 252506267 is an apocalyptic number.
52506267 is a deficient number, since it is larger than the sum of its proper divisors (23866533).
52506267 is a wasteful number, since it uses less digits than its factorization.
52506267 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1591113.
The product of its (nonzero) digits is 25200, while the sum is 33.
The square root of 52506267 is about 7246.1208242756. The cubic root of 52506267 is about 374.4585180580.
The spelling of 52506267 in words is "fifty-two million, five hundred six thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •