Base | Representation |
---|---|
bin | 10011001111110… |
… | …11001110100000 |
3 | 102020211002001200 |
4 | 21213323032200 |
5 | 312313224102 |
6 | 24004401200 |
7 | 4000253136 |
oct | 1147731640 |
9 | 366732050 |
10 | 161461152 |
11 | 83160176 |
12 | 460a6200 |
13 | 275b2858 |
14 | 1762d756 |
15 | e29551c |
hex | 99fb3a0 |
161461152 has 72 divisors (see below), whose sum is σ = 463698144. Its totient is φ = 53288064.
The previous prime is 161461151. The next prime is 161461163. The reversal of 161461152 is 251164161.
It is a tau number, because it is divible by the number of its divisors (72).
It is not an unprimeable number, because it can be changed into a prime (161461151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26943 + ... + 32385.
It is an arithmetic number, because the mean of its divisors is an integer number (6440252).
Almost surely, 2161461152 is an apocalyptic number.
161461152 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 161461152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (231849072).
161461152 is an abundant number, since it is smaller than the sum of its proper divisors (302236992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161461152 is a wasteful number, since it uses less digits than its factorization.
161461152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5562 (or 5551 counting only the distinct ones).
The product of its digits is 1440, while the sum is 27.
The square root of 161461152 is about 12706.7364810954. The cubic root of 161461152 is about 544.5310917797.
The spelling of 161461152 in words is "one hundred sixty-one million, four hundred sixty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •