Base | Representation |
---|---|
bin | 1001101011100100000… |
… | …1110111100111100000 |
3 | 120220021122022102001212 |
4 | 2122321001313213200 |
5 | 10211102114012120 |
6 | 204223025245252 |
7 | 15005251306532 |
oct | 2327101674740 |
9 | 526248272055 |
10 | 166313032160 |
11 | 64595409710 |
12 | 28295a93828 |
13 | 128b6147202 |
14 | 809a129852 |
15 | 44d5d0a6c5 |
hex | 26b90779e0 |
166313032160 has 48 divisors (see below), whose sum is σ = 428634046512. Its totient is φ = 60477465600.
The previous prime is 166313032157. The next prime is 166313032201. The reversal of 166313032160 is 61230313661.
166313032160 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
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, 47246261 + ... + 47249780.
It is an arithmetic number, because the mean of its divisors is an integer number (8929875969).
Almost surely, 2166313032160 is an apocalyptic number.
166313032160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
166313032160 is an abundant number, since it is smaller than the sum of its proper divisors (262321014352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166313032160 is a wasteful number, since it uses less digits than its factorization.
166313032160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94496067 (or 94496059 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 166313032160 in words is "one hundred sixty-six billion, three hundred thirteen million, thirty-two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •