Base | Representation |
---|---|
bin | 1110101100110001011… |
… | …0110011111101110101 |
3 | 220010211201020021112002 |
4 | 3223030112303331311 |
5 | 13114143334312003 |
6 | 312002544305045 |
7 | 24150043660550 |
oct | 3531426637565 |
9 | 803751207462 |
10 | 252536635253 |
11 | 9811138a921 |
12 | 40b3a012185 |
13 | 1aa777774b6 |
14 | c31967b697 |
15 | 688087ea88 |
hex | 3acc5b3f75 |
252536635253 has 8 divisors (see below), whose sum is σ = 294754006272. Its totient is φ = 211854441456.
The previous prime is 252536635193. The next prime is 252536635277. The reversal of 252536635253 is 352536635252.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 252536635253 - 212 = 252536631157 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 252536635198 and 252536635207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252536635753) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 383793950 + ... + 383794607.
It is an arithmetic number, because the mean of its divisors is an integer number (36844250784).
Almost surely, 2252536635253 is an apocalyptic number.
It is an amenable number.
252536635253 is a deficient number, since it is larger than the sum of its proper divisors (42217371019).
252536635253 is an equidigital number, since it uses as much as digits as its factorization.
252536635253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 767588611.
The product of its digits is 4860000, while the sum is 47.
Subtracting 252536635253 from its reverse (352536635252), we obtain a palindrome (99999999999).
The spelling of 252536635253 in words is "two hundred fifty-two billion, five hundred thirty-six million, six hundred thirty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •