Base | Representation |
---|---|
bin | 11110001000100… |
… | …00101010001010 |
3 | 122121122022011220 |
4 | 33010100222022 |
5 | 1004202300200 |
6 | 41025502510 |
7 | 6156360333 |
oct | 1704205212 |
9 | 577568156 |
10 | 252775050 |
11 | 11a759700 |
12 | 707a1a36 |
13 | 404a4848 |
14 | 257dd28a |
15 | 172d14a0 |
hex | f110a8a |
252775050 has 144 divisors (see below), whose sum is σ = 726307680. Its totient is φ = 57974400.
The previous prime is 252774931. The next prime is 252775051. The reversal of 252775050 is 50577252.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (252775051) by changing a digit.
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 71 ways as a sum of consecutive naturals, for example, 344484 + ... + 345216.
Almost surely, 2252775050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 252775050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (363153840).
252775050 is an abundant number, since it is smaller than the sum of its proper divisors (473532630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252775050 is a wasteful number, since it uses less digits than its factorization.
252775050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789 (or 773 counting only the distinct ones).
The product of its (nonzero) digits is 24500, while the sum is 33.
The square root of 252775050 is about 15898.9009054085. The cubic root of 252775050 is about 632.2828492115.
It can be divided in two parts, 2527 and 75050, that added together give a palindrome (77577).
The spelling of 252775050 in words is "two hundred fifty-two million, seven hundred seventy-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •