Base | Representation |
---|---|
bin | 11110000011000… |
… | …01110110100110 |
3 | 122120021221000020 |
4 | 33001201312212 |
5 | 1004011342141 |
6 | 41002300010 |
7 | 6150316011 |
oct | 1701416646 |
9 | 576257006 |
10 | 252059046 |
11 | 11a30a768 |
12 | 704b7606 |
13 | 402b3985 |
14 | 25694378 |
15 | 171de266 |
hex | f061da6 |
252059046 has 8 divisors (see below), whose sum is σ = 504118104. Its totient is φ = 84019680.
The previous prime is 252059023. The next prime is 252059081. The reversal of 252059046 is 640950252.
252059046 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.
252059046 is an admirable number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 252058998 and 252059016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21004915 + ... + 21004926.
It is an arithmetic number, because the mean of its divisors is an integer number (63014763).
Almost surely, 2252059046 is an apocalyptic number.
252059046 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252059046 is a wasteful number, since it uses less digits than its factorization.
252059046 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42009846.
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 252059046 is about 15876.3675316490. The cubic root of 252059046 is about 631.6852886867.
The spelling of 252059046 in words is "two hundred fifty-two million, fifty-nine thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •