Base | Representation |
---|---|
bin | 1110101010110100110… |
… | …1001000101111101001 |
3 | 220002111021210220220101 |
4 | 3222231031020233221 |
5 | 13112111041131400 |
6 | 311435034425401 |
7 | 24131066462053 |
oct | 3525515105751 |
9 | 802437726811 |
10 | 252014005225 |
11 | 97973377184 |
12 | 40a12b92261 |
13 | 1a9c33cab68 |
14 | c2aa0b48d3 |
15 | 684ea4656a |
hex | 3aad348be9 |
252014005225 has 6 divisors (see below), whose sum is σ = 312497366510. Its totient is φ = 201611204160.
The previous prime is 252014005189. The next prime is 252014005237. The reversal of 252014005225 is 522500410252.
It can be written as a sum of positive squares in 3 ways, for example, as 85154826969 + 166859178256 = 291813^2 + 408484^2 .
It is not a de Polignac number, because 252014005225 - 225 = 251980450793 is a prime.
It is a super-2 number, since 2×2520140052252 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 252014005193 and 252014005202.
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, 5040280080 + ... + 5040280129.
Almost surely, 2252014005225 is an apocalyptic number.
252014005225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
252014005225 is a deficient number, since it is larger than the sum of its proper divisors (60483361285).
252014005225 is a wasteful number, since it uses less digits than its factorization.
252014005225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10080560219 (or 10080560214 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
Adding to 252014005225 its reverse (522500410252), we get a palindrome (774514415477).
The spelling of 252014005225 in words is "two hundred fifty-two billion, fourteen million, five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •