Base | Representation |
---|---|
bin | 10011101010011… |
… | …01010011100000 |
3 | 102111100222100200 |
4 | 21311031103200 |
5 | 314211134242 |
6 | 24211145200 |
7 | 4041664410 |
oct | 1165152340 |
9 | 374328320 |
10 | 164943072 |
11 | 85119198 |
12 | 472a5200 |
13 | 28231668 |
14 | 17c98640 |
15 | e73204c |
hex | 9d4d4e0 |
164943072 has 72 divisors (see below), whose sum is σ = 536071536. Its totient is φ = 47126016.
The previous prime is 164943059. The next prime is 164943083. The reversal of 164943072 is 270349461.
164943072 is a `hidden beast` number, since 1 + 649 + 4 + 3 + 0 + 7 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 38893 + ... + 42924.
It is an arithmetic number, because the mean of its divisors is an integer number (7445438).
Almost surely, 2164943072 is an apocalyptic number.
164943072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
164943072 is an abundant number, since it is smaller than the sum of its proper divisors (371128464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164943072 is a wasteful number, since it uses less digits than its factorization.
164943072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81840 (or 81829 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The square root of 164943072 is about 12843.0164681044. The cubic root of 164943072 is about 548.4175693880.
The spelling of 164943072 in words is "one hundred sixty-four million, nine hundred forty-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •