Base | Representation |
---|---|
bin | 1110101110111101000… |
… | …0001110001010101101 |
3 | 220012100111220111001121 |
4 | 3223233100032022231 |
5 | 13121343230011000 |
6 | 312141021140541 |
7 | 24200413302433 |
oct | 3535720161255 |
9 | 805314814047 |
10 | 253122110125 |
11 | 98391917855 |
12 | 410820ba751 |
13 | 1ab3bb58931 |
14 | c373322d53 |
15 | 68b6e7db1a |
hex | 3aef40e2ad |
253122110125 has 64 divisors (see below), whose sum is σ = 330739718400. Its totient is φ = 193165996800.
The previous prime is 253122110093. The next prime is 253122110141. The reversal of 253122110125 is 521011221352.
It is a happy number.
It is not a de Polignac number, because 253122110125 - 25 = 253122110093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 253122110125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 114378519 + ... + 114380731.
It is an arithmetic number, because the mean of its divisors is an integer number (5167808100).
Almost surely, 2253122110125 is an apocalyptic number.
253122110125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
253122110125 is a deficient number, since it is larger than the sum of its proper divisors (77617608275).
253122110125 is a wasteful number, since it uses less digits than its factorization.
253122110125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2623 (or 2613 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 253122110125 its reverse (521011221352), we get a palindrome (774133331477).
The spelling of 253122110125 in words is "two hundred fifty-three billion, one hundred twenty-two million, one hundred ten thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •