Base | Representation |
---|---|
bin | 10011100011010… |
… | …10001110110000 |
3 | 102102121201111200 |
4 | 21301222032300 |
5 | 313441403401 |
6 | 24135211200 |
7 | 4031041641 |
oct | 1161521660 |
9 | 372551450 |
10 | 164012976 |
11 | 84643416 |
12 | 46b16b00 |
13 | 27c971ca |
14 | 17ad56c8 |
15 | e5eb686 |
hex | 9c6a3b0 |
164012976 has 30 divisors (see below), whose sum is σ = 459008940. Its totient is φ = 54670944.
The previous prime is 164012929. The next prime is 164012983. The reversal of 164012976 is 679210461.
164012976 is a `hidden beast` number, since 1 + 640 + 1 + 2 + 9 + 7 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 164012976.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 569346 + ... + 569633.
It is an arithmetic number, because the mean of its divisors is an integer number (15300298).
Almost surely, 2164012976 is an apocalyptic number.
164012976 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
164012976 is an abundant number, since it is smaller than the sum of its proper divisors (294995964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164012976 is a wasteful number, since it uses less digits than its factorization.
164012976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1138993 (or 1138984 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 164012976 is about 12806.7550925283. The cubic root of 164012976 is about 547.3848034363.
The spelling of 164012976 in words is "one hundred sixty-four million, twelve thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •