Base | Representation |
---|---|
bin | 100110110000… |
… | …110000001010 |
3 | 201010020111100 |
4 | 212300300022 |
5 | 10100124122 |
6 | 1001442230 |
7 | 152240244 |
oct | 46606012 |
9 | 21106440 |
10 | 10161162 |
11 | 5810260 |
12 | 34a0376 |
13 | 214a02b |
14 | 14c7094 |
15 | d5aaac |
hex | 9b0c0a |
10161162 has 96 divisors (see below), whose sum is σ = 26320320. Its totient is φ = 2799360.
The previous prime is 10161161. The next prime is 10161163. The reversal of 10161162 is 26116101.
It is an interprime number because it is at equal distance from previous prime (10161161) and next prime (10161163).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10161161) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 139158 + ... + 139230.
It is an arithmetic number, because the mean of its divisors is an integer number (274170).
Almost surely, 210161162 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10161162, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13160160).
10161162 is an abundant number, since it is smaller than the sum of its proper divisors (16159158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10161162 is a wasteful number, since it uses less digits than its factorization.
10161162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148 (or 145 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The square root of 10161162 is about 3187.6577608018. The cubic root of 10161162 is about 216.5946832539.
Adding to 10161162 its reverse (26116101), we get a palindrome (36277263).
The spelling of 10161162 in words is "ten million, one hundred sixty-one thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •