Base | Representation |
---|---|
bin | 11110001000011… |
… | …11000100000000 |
3 | 122121121222012202 |
4 | 33010033010000 |
5 | 1004202043022 |
6 | 41025412332 |
7 | 6156332303 |
oct | 1704170400 |
9 | 577558182 |
10 | 252768512 |
11 | 11a7547a7 |
12 | 7079a0a8 |
13 | 404a1889 |
14 | 257dab3a |
15 | 172ce592 |
hex | f10f100 |
252768512 has 54 divisors (see below), whose sum is σ = 536454954. Its totient is φ = 118456320.
The previous prime is 252768499. The next prime is 252768521. The reversal of 252768512 is 215867252.
It can be written as a sum of positive squares in 3 ways, for example, as 131239936 + 121528576 = 11456^2 + 11024^2 .
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1048712 + ... + 1048952.
It is an arithmetic number, because the mean of its divisors is an integer number (9934351).
Almost surely, 2252768512 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 252768512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (268227477).
252768512 is an abundant number, since it is smaller than the sum of its proper divisors (283686442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252768512 is an frugal number, since it uses more digits than its factorization.
252768512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 515 (or 260 counting only the distinct ones).
The product of its digits is 67200, while the sum is 38.
The square root of 252768512 is about 15898.6952923817. The cubic root of 252768512 is about 632.2773978548.
The spelling of 252768512 in words is "two hundred fifty-two million, seven hundred sixty-eight thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •