Base | Representation |
---|---|
bin | 1001010100000101000… |
… | …1111001010010111101 |
3 | 120022000022011101211220 |
4 | 2111001101321102331 |
5 | 10110144301001000 |
6 | 201301312103553 |
7 | 14363113026432 |
oct | 2250121712275 |
9 | 508008141756 |
10 | 160009000125 |
11 | 6194aa00087 |
12 | 27016834bb9 |
13 | 1212009b340 |
14 | 7a5cbb7b89 |
15 | 42676691a0 |
hex | 25414794bd |
160009000125 has 128 divisors (see below), whose sum is σ = 305308942848. Its totient is φ = 73723392000.
The previous prime is 160009000121. The next prime is 160009000133. The reversal of 160009000125 is 521000900061.
It is not a de Polignac number, because 160009000125 - 22 = 160009000121 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 160009000095 and 160009000104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160009000121) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 14995042 + ... + 15005708.
It is an arithmetic number, because the mean of its divisors is an integer number (2385226116).
Almost surely, 2160009000125 is an apocalyptic number.
160009000125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
160009000125 is a deficient number, since it is larger than the sum of its proper divisors (145299942723).
160009000125 is a wasteful number, since it uses less digits than its factorization.
160009000125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10896 (or 10886 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 24.
Adding to 160009000125 its reverse (521000900061), we get a palindrome (681009900186).
The spelling of 160009000125 in words is "one hundred sixty billion, nine million, one hundred twenty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •