Base | Representation |
---|---|
bin | 10011100011010… |
… | …10000110010100 |
3 | 102102121200202200 |
4 | 21301222012110 |
5 | 313441344221 |
6 | 24135204500 |
7 | 4031040240 |
oct | 1161520624 |
9 | 372550680 |
10 | 164012436 |
11 | 84642a75 |
12 | 46b16730 |
13 | 27c96ba3 |
14 | 17ad5420 |
15 | e5eb426 |
hex | 9c6a194 |
164012436 has 72 divisors (see below), whose sum is σ = 475884864. Its totient is φ = 46656000.
The previous prime is 164012411. The next prime is 164012437. The reversal of 164012436 is 634210461.
164012436 is a `hidden beast` number, since 1 + 640 + 12 + 4 + 3 + 6 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164012437) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 61956 + ... + 64548.
It is an arithmetic number, because the mean of its divisors is an integer number (6609512).
Almost surely, 2164012436 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 164012436, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (237942432).
164012436 is an abundant number, since it is smaller than the sum of its proper divisors (311872428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164012436 is a wasteful number, since it uses less digits than its factorization.
164012436 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2861 (or 2856 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 164012436 is about 12806.7340098871. The cubic root of 164012436 is about 547.3842026950.
Adding to 164012436 its reverse (634210461), we get a palindrome (798222897).
The spelling of 164012436 in words is "one hundred sixty-four million, twelve thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •