Base | Representation |
---|---|
bin | 11101110100001100… |
… | …11101010110101000 |
3 | 1112022120021211120121 |
4 | 32322012131112220 |
5 | 230240313012120 |
6 | 11204212533024 |
7 | 1104446406451 |
oct | 167206352650 |
9 | 45276254517 |
10 | 16007157160 |
11 | 6874694105 |
12 | 3128921174 |
13 | 16813c0b37 |
14 | abbcb6128 |
15 | 63a45b5aa |
hex | 3ba19d5a8 |
16007157160 has 64 divisors (see below), whose sum is σ = 38355411600. Its totient is φ = 5991346176.
The previous prime is 16007157151. The next prime is 16007157163. The reversal of 16007157160 is 6175170061.
It can be written as a sum of positive squares in 8 ways, for example, as 12399713316 + 3607443844 = 111354^2 + 60062^2 .
It is a Harshad number since it is a multiple of its sum of digits (34).
It is not an unprimeable number, because it can be changed into a prime (16007157163) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49606 + ... + 185674.
Almost surely, 216007157160 is an apocalyptic number.
16007157160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16007157160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19177705800).
16007157160 is an abundant number, since it is smaller than the sum of its proper divisors (22348254440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16007157160 is a wasteful number, since it uses less digits than its factorization.
16007157160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136270 (or 136266 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 34.
The spelling of 16007157160 in words is "sixteen billion, seven million, one hundred fifty-seven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •