Base | Representation |
---|---|
bin | 10011001110000… |
… | …10100011011000 |
3 | 102020101021122001 |
4 | 21213002203120 |
5 | 312233312031 |
6 | 23555410344 |
7 | 3665265304 |
oct | 1147024330 |
9 | 366337561 |
10 | 161229016 |
11 | 83011823 |
12 | 45bb39b4 |
13 | 27530cb0 |
14 | 175acd04 |
15 | e24b861 |
hex | 99c28d8 |
161229016 has 64 divisors (see below), whose sum is σ = 344171520. Its totient is φ = 70277760.
The previous prime is 161229007. The next prime is 161229031. The reversal of 161229016 is 610922161.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138051 + ... + 139213.
It is an arithmetic number, because the mean of its divisors is an integer number (5377680).
Almost surely, 2161229016 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 161229016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172085760).
161229016 is an abundant number, since it is smaller than the sum of its proper divisors (182942504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161229016 is a wasteful number, since it uses less digits than its factorization.
161229016 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1256 (or 1252 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 161229016 is about 12697.5988281249. The cubic root of 161229016 is about 544.2700054547.
It can be divided in two parts, 1612 and 29016, that added together give a triangular number (30628 = T247).
The spelling of 161229016 in words is "one hundred sixty-one million, two hundred twenty-nine thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •