Base | Representation |
---|---|
bin | 10011010000100… |
… | …10001101000000 |
3 | 102020222212011022 |
4 | 21220102031000 |
5 | 312324232024 |
6 | 24010405012 |
7 | 4001124413 |
oct | 1150221500 |
9 | 366885138 |
10 | 161555264 |
11 | 83214952 |
12 | 46130768 |
13 | 27616640 |
14 | 17655b7a |
15 | e2b335e |
hex | 9a12340 |
161555264 has 56 divisors (see below), whose sum is σ = 346987368. Its totient is φ = 74188800.
The previous prime is 161555239. The next prime is 161555279. The reversal of 161555264 is 462555161.
It can be written as a sum of positive squares in 4 ways, for example, as 7795264 + 153760000 = 2792^2 + 12400^2 .
It is a super-2 number, since 2×1615552642 = 52200206652219392, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 230114 + ... + 230814.
It is an arithmetic number, because the mean of its divisors is an integer number (6196203).
Almost surely, 2161555264 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 161555264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173493684).
161555264 is an abundant number, since it is smaller than the sum of its proper divisors (185432104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161555264 is a wasteful number, since it uses less digits than its factorization.
161555264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003 (or 993 counting only the distinct ones).
The product of its digits is 36000, while the sum is 35.
The square root of 161555264 is about 12710.4391741592. The cubic root of 161555264 is about 544.6368694561.
The spelling of 161555264 in words is "one hundred sixty-one million, five hundred fifty-five thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •