Base | Representation |
---|---|
bin | 10011001110101… |
… | …10011000000100 |
3 | 102020112102000022 |
4 | 21213112120010 |
5 | 312243411322 |
6 | 24001234312 |
7 | 3666054110 |
oct | 1147263004 |
9 | 366472008 |
10 | 161310212 |
11 | 83067828 |
12 | 46032998 |
13 | 2755bc3b |
14 | 175d0740 |
15 | e265942 |
hex | 99d6604 |
161310212 has 48 divisors (see below), whose sum is σ = 344736000. Its totient is φ = 64468992.
The previous prime is 161310211. The next prime is 161310221. The reversal of 161310212 is 212013161.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is not an unprimeable number, because it can be changed into a prime (161310211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52289 + ... + 55287.
It is an arithmetic number, because the mean of its divisors is an integer number (7182000).
Almost surely, 2161310212 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 161310212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172368000).
161310212 is an abundant number, since it is smaller than the sum of its proper divisors (183425788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161310212 is a wasteful number, since it uses less digits than its factorization.
161310212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3140 (or 3138 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 161310212 is about 12700.7957231033. The cubic root of 161310212 is about 544.3613561143.
Adding to 161310212 its reverse (212013161), we get a palindrome (373323373).
The spelling of 161310212 in words is "one hundred sixty-one million, three hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •