Base | Representation |
---|---|
bin | 11110000100101… |
… | …00001010101000 |
3 | 122120200101200220 |
4 | 33002110022220 |
5 | 1004034441003 |
6 | 41010530040 |
7 | 6152134563 |
oct | 1702241250 |
9 | 576611626 |
10 | 252265128 |
11 | 11a440585 |
12 | 70596920 |
13 | 4035670b |
14 | 257094da |
15 | 17230353 |
hex | f0942a8 |
252265128 has 128 divisors (see below), whose sum is σ = 691891200. Its totient is φ = 76377600.
The previous prime is 252265103. The next prime is 252265163. The reversal of 252265128 is 821562252.
It is a happy number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1925623 + ... + 1925753.
It is an arithmetic number, because the mean of its divisors is an integer number (5405400).
Almost surely, 2252265128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 252265128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (345945600).
252265128 is an abundant number, since it is smaller than the sum of its proper divisors (439626072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252265128 is a wasteful number, since it uses less digits than its factorization.
252265128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303 (or 299 counting only the distinct ones).
The product of its digits is 19200, while the sum is 33.
The square root of 252265128 is about 15882.8564181636. The cubic root of 252265128 is about 631.8573958550.
The spelling of 252265128 in words is "two hundred fifty-two million, two hundred sixty-five thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •