Base | Representation |
---|---|
bin | 10011101111111… |
… | …01010101101110 |
3 | 102112201121102210 |
4 | 21313331111232 |
5 | 314402222420 |
6 | 24234431250 |
7 | 4051056513 |
oct | 1167752556 |
9 | 375647383 |
10 | 165664110 |
11 | 85570997 |
12 | 47592526 |
13 | 28424901 |
14 | 1800530a |
15 | e8259e0 |
hex | 9dfd56e |
165664110 has 16 divisors (see below), whose sum is σ = 397593936. Its totient is φ = 44177088.
The previous prime is 165664073. The next prime is 165664111. The reversal of 165664110 is 11466561.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 5522137 = 165664110 / (1 + 6 + 5 + 6 + 6 + 4 + 1 + 1 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165664111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2761039 + ... + 2761098.
It is an arithmetic number, because the mean of its divisors is an integer number (24849621).
Almost surely, 2165664110 is an apocalyptic number.
165664110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
165664110 is an abundant number, since it is smaller than the sum of its proper divisors (231929826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
165664110 is a wasteful number, since it uses less digits than its factorization.
165664110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5522147.
The product of its (nonzero) digits is 4320, while the sum is 30.
The square root of 165664110 is about 12871.0570661465. The cubic root of 165664110 is about 549.2155317781.
The spelling of 165664110 in words is "one hundred sixty-five million, six hundred sixty-four thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •