Base | Representation |
---|---|
bin | 1001010111101111100… |
… | …1100001110010110110 |
3 | 120101112211201202100120 |
4 | 2111323321201302312 |
5 | 10114203032440100 |
6 | 201543043152410 |
7 | 14426354254233 |
oct | 2257371416266 |
9 | 511484652316 |
10 | 160992468150 |
11 | 62305062178 |
12 | 27250075706 |
13 | 12248a6a797 |
14 | 7b1366078a |
15 | 42c3b820a0 |
hex | 257be61cb6 |
160992468150 has 60 divisors (see below), whose sum is σ = 401479439460. Its totient is φ = 42694135200.
The previous prime is 160992468139. The next prime is 160992468187. The reversal of 160992468150 is 51864299061.
It is a junction number, because it is equal to n+sod(n) for n = 160992468093 and 160992468102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 889461060 + ... + 889461240.
It is an arithmetic number, because the mean of its divisors is an integer number (6691323991).
Almost surely, 2160992468150 is an apocalyptic number.
160992468150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 160992468150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200739719730).
160992468150 is an abundant number, since it is smaller than the sum of its proper divisors (240486971310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160992468150 is an frugal number, since it uses more digits than its factorization.
160992468150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 739 (or 191 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 51.
The spelling of 160992468150 in words is "one hundred sixty billion, nine hundred ninety-two million, four hundred sixty-eight thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •