Base | Representation |
---|---|
bin | 11110001000101… |
… | …11101000000101 |
3 | 122121200202022220 |
4 | 33010113220011 |
5 | 1004204203324 |
6 | 41030242553 |
7 | 6156536463 |
oct | 1704275005 |
9 | 577622286 |
10 | 252803589 |
11 | 11a779095 |
12 | 707b6459 |
13 | 404b482c |
14 | 25809833 |
15 | 172d9b79 |
hex | f117a05 |
252803589 has 8 divisors (see below), whose sum is σ = 338836992. Its totient is φ = 167652960.
The previous prime is 252803563. The next prime is 252803597. The reversal of 252803589 is 985308252.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 252803589 - 28 = 252803333 is a prime.
It is a super-2 number, since 2×2528035892 = 127819309222561842, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 252803589.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252803389) 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, 220024 + ... + 221169.
It is an arithmetic number, because the mean of its divisors is an integer number (42354624).
Almost surely, 2252803589 is an apocalyptic number.
It is an amenable number.
252803589 is a deficient number, since it is larger than the sum of its proper divisors (86033403).
252803589 is a wasteful number, since it uses less digits than its factorization.
252803589 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441387.
The product of its (nonzero) digits is 172800, while the sum is 42.
The square root of 252803589 is about 15899.7983949483. The cubic root of 252803589 is about 632.3066438083.
The spelling of 252803589 in words is "two hundred fifty-two million, eight hundred three thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •