Base | Representation |
---|---|
bin | 10011010001010… |
… | …10011000000000 |
3 | 102021011212222021 |
4 | 21220222120000 |
5 | 312340414042 |
6 | 24012451224 |
7 | 4002016153 |
oct | 1150523000 |
9 | 367155867 |
10 | 161654272 |
11 | 8328227a |
12 | 46179b14 |
13 | 2764c720 |
14 | 1767dc9a |
15 | e2d2867 |
hex | 9a2a600 |
161654272 has 80 divisors (see below), whose sum is σ = 352321200. Its totient is φ = 73654272.
The previous prime is 161654263. The next prime is 161654279. The reversal of 161654272 is 272456161.
It is a super-2 number, since 2×1616542722 = 52264207311699968, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161654279) 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, 991663 + ... + 991825.
It is an arithmetic number, because the mean of its divisors is an integer number (4404015).
Almost surely, 2161654272 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 161654272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176160600).
161654272 is an abundant number, since it is smaller than the sum of its proper divisors (190666928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161654272 is a wasteful number, since it uses less digits than its factorization.
161654272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343 (or 327 counting only the distinct ones).
The product of its digits is 20160, while the sum is 34.
The square root of 161654272 is about 12714.3333289638. Note that the first 4 decimals coincide. The cubic root of 161654272 is about 544.7481056858.
The spelling of 161654272 in words is "one hundred sixty-one million, six hundred fifty-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •