Base | Representation |
---|---|
bin | 1001001001011101111… |
… | …0111011001001011100 |
3 | 120000122202210212122021 |
4 | 2102113132323021130 |
5 | 10033331013220420 |
6 | 200110510225524 |
7 | 14232402261661 |
oct | 2222736731134 |
9 | 500582725567 |
10 | 157160288860 |
11 | 60718982153 |
12 | 265607b52a4 |
13 | 11a87b47483 |
14 | 786c713a68 |
15 | 414c50b7aa |
hex | 24977bb25c |
157160288860 has 24 divisors (see below), whose sum is σ = 330058015056. Its totient is φ = 62860037760.
The previous prime is 157160288843. The next prime is 157160288863. The reversal of 157160288860 is 68882061751.
It is a hoax number, since the sum of its digits (52) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 157160288798 and 157160288807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157160288863) 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, 71355 + ... + 565165.
It is an arithmetic number, because the mean of its divisors is an integer number (13752417294).
Almost surely, 2157160288860 is an apocalyptic number.
157160288860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
157160288860 is an abundant number, since it is smaller than the sum of its proper divisors (172897726196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157160288860 is a wasteful number, since it uses less digits than its factorization.
157160288860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509733 (or 509731 counting only the distinct ones).
The product of its (nonzero) digits is 1290240, while the sum is 52.
The spelling of 157160288860 in words is "one hundred fifty-seven billion, one hundred sixty million, two hundred eighty-eight thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •