Base | Representation |
---|---|
bin | 10011101010001… |
… | …01100000000110 |
3 | 102111022100111220 |
4 | 21311011200012 |
5 | 314204123420 |
6 | 24210341210 |
7 | 4041502260 |
oct | 1165054006 |
9 | 374270456 |
10 | 164911110 |
11 | 850a7181 |
12 | 4728a806 |
13 | 2821cc50 |
14 | 17c8ab30 |
15 | e727840 |
hex | 9d45806 |
164911110 has 128 divisors (see below), whose sum is σ = 504161280. Its totient is φ = 33578496.
The previous prime is 164911069. The next prime is 164911111. The reversal of 164911110 is 11119461.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164911111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 78129 + ... + 80211.
It is an arithmetic number, because the mean of its divisors is an integer number (3938760).
Almost surely, 2164911110 is an apocalyptic number.
164911110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 164911110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252080640).
164911110 is an abundant number, since it is smaller than the sum of its proper divisors (339250170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164911110 is a wasteful number, since it uses less digits than its factorization.
164911110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2142.
The product of its (nonzero) digits is 216, while the sum is 24.
The square root of 164911110 is about 12841.7720739780. The cubic root of 164911110 is about 548.3821437217.
The spelling of 164911110 in words is "one hundred sixty-four million, nine hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •