Base | Representation |
---|---|
bin | 10011001100110… |
… | …10110011111000 |
3 | 102020002000100000 |
4 | 21212122303320 |
5 | 312213104412 |
6 | 23552113000 |
7 | 3664016565 |
oct | 1146326370 |
9 | 366060300 |
10 | 161066232 |
11 | 82a10498 |
12 | 45b35760 |
13 | 274a4b82 |
14 | 1756986c |
15 | e2184dc |
hex | 999acf8 |
161066232 has 96 divisors (see below), whose sum is σ = 468140400. Its totient is φ = 51819264.
The previous prime is 161066221. The next prime is 161066233. The reversal of 161066232 is 232660161.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 161066196 and 161066205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161066233) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 54948 + ... + 57804.
Almost surely, 2161066232 is an apocalyptic number.
161066232 is a gapful number since it is divisible by the number (12) 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 161066232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234070200).
161066232 is an abundant number, since it is smaller than the sum of its proper divisors (307074168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161066232 is a wasteful number, since it uses less digits than its factorization.
161066232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2907 (or 2891 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 161066232 is about 12691.1871785109. The cubic root of 161066232 is about 544.0867706889.
The spelling of 161066232 in words is "one hundred sixty-one million, sixty-six thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •