Base | Representation |
---|---|
bin | 10011001100011… |
… | …00001000000000 |
3 | 102012221221211011 |
4 | 21212030020000 |
5 | 312204143310 |
6 | 23550530304 |
7 | 3663346324 |
oct | 1146141000 |
9 | 365857734 |
10 | 161006080 |
11 | 8297a284 |
12 | 45b06994 |
13 | 27483691 |
14 | 17551984 |
15 | e20578a |
hex | 998c200 |
161006080 has 80 divisors (see below), whose sum is σ = 390254040. Its totient is φ = 63700992.
The previous prime is 161006077. The next prime is 161006081. The reversal of 161006080 is 80600161.
It can be written as a sum of positive squares in 4 ways, for example, as 160985344 + 20736 = 12688^2 + 144^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (161006081) 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, 278752 + ... + 279328.
Almost surely, 2161006080 is an apocalyptic number.
161006080 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 161006080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195127020).
161006080 is an abundant number, since it is smaller than the sum of its proper divisors (229247960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161006080 is an equidigital number, since it uses as much as digits as its factorization.
161006080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 709 (or 693 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 161006080 is about 12688.8171237511. The cubic root of 161006080 is about 544.0190304761.
The spelling of 161006080 in words is "one hundred sixty-one million, six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •