Base | Representation |
---|---|
bin | 1001001001001111101… |
… | …0110111101100001000 |
3 | 120000111121022120210020 |
4 | 2102103322313230020 |
5 | 10033220212141424 |
6 | 200100533020440 |
7 | 14231045160351 |
oct | 2222372675410 |
9 | 500447276706 |
10 | 157100505864 |
11 | 6069815a315 |
12 | 26544784720 |
13 | 11a78645213 |
14 | 78647d0d28 |
15 | 414714d079 |
hex | 2493eb7b08 |
157100505864 has 128 divisors (see below), whose sum is σ = 404000835840. Its totient is φ = 50888195072.
The previous prime is 157100505841. The next prime is 157100505907. The reversal of 157100505864 is 468505001751.
157100505864 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67337242 + ... + 67339574.
It is an arithmetic number, because the mean of its divisors is an integer number (3156256530).
Almost surely, 2157100505864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 157100505864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202000417920).
157100505864 is an abundant number, since it is smaller than the sum of its proper divisors (246900329976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157100505864 is a wasteful number, since it uses less digits than its factorization.
157100505864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2879 (or 2875 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 42.
The spelling of 157100505864 in words is "one hundred fifty-seven billion, one hundred million, five hundred five thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •