Base | Representation |
---|---|
bin | 11110000110111… |
… | …00000110000101 |
3 | 122121020100211210 |
4 | 33003130012011 |
5 | 1004123402444 |
6 | 41021122033 |
7 | 6154502541 |
oct | 1703340605 |
9 | 577210753 |
10 | 252559749 |
11 | 11a621972 |
12 | 706b9319 |
13 | 4042a850 |
14 | 25784a21 |
15 | 1728c7b9 |
hex | f0dc185 |
252559749 has 16 divisors (see below), whose sum is σ = 364246400. Its totient is φ = 154737216.
The previous prime is 252559739. The next prime is 252559781. The reversal of 252559749 is 947955252.
It is a happy number.
It is not a de Polignac number, because 252559749 - 24 = 252559733 is a prime.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 252559698 and 252559707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252559739) 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 15 ways as a sum of consecutive naturals, for example, 5209 + ... + 23070.
It is an arithmetic number, because the mean of its divisors is an integer number (22765400).
Almost surely, 2252559749 is an apocalyptic number.
It is an amenable number.
252559749 is a deficient number, since it is larger than the sum of its proper divisors (111686651).
252559749 is a wasteful number, since it uses less digits than its factorization.
252559749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28524.
The product of its digits is 1134000, while the sum is 48.
The square root of 252559749 is about 15892.1285232658. The cubic root of 252559749 is about 632.1032827051.
The spelling of 252559749 in words is "two hundred fifty-two million, five hundred fifty-nine thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •