Base | Representation |
---|---|
bin | 10011100101001… |
… | …01000000001100 |
3 | 102110001221201200 |
4 | 21302211000030 |
5 | 314022104313 |
6 | 24144305500 |
7 | 4033063533 |
oct | 1162450014 |
9 | 373057650 |
10 | 164253708 |
11 | 84798273 |
12 | 47012290 |
13 | 2804c958 |
14 | 17b5931a |
15 | e647b73 |
hex | 9ca500c |
164253708 has 72 divisors (see below), whose sum is σ = 447785520. Its totient is φ = 50595840.
The previous prime is 164253701. The next prime is 164253769. The reversal of 164253708 is 807352461.
164253708 is a `hidden beast` number, since 1 + 642 + 5 + 3 + 7 + 0 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (164253701) 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, 25116 + ... + 30972.
Almost surely, 2164253708 is an apocalyptic number.
164253708 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 164253708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223892760).
164253708 is an abundant number, since it is smaller than the sum of its proper divisors (283531812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164253708 is a wasteful number, since it uses less digits than its factorization.
164253708 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5927 (or 5922 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 164253708 is about 12816.1502800178. The cubic root of 164253708 is about 547.6524827052.
The spelling of 164253708 in words is "one hundred sixty-four million, two hundred fifty-three thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •