Base | Representation |
---|---|
bin | 10011100101010… |
… | …10011111001100 |
3 | 102110010002112200 |
4 | 21302222133030 |
5 | 314023314142 |
6 | 24145001500 |
7 | 4033216164 |
oct | 1162523714 |
9 | 373102480 |
10 | 164276172 |
11 | 84803135 |
12 | 47023290 |
13 | 28059c48 |
14 | 17b635a4 |
15 | e64e64c |
hex | 9caa7cc |
164276172 has 72 divisors (see below), whose sum is σ = 425181120. Its totient is φ = 53464320.
The previous prime is 164276171. The next prime is 164276183. The reversal of 164276172 is 271672461.
164276172 is a `hidden beast` number, since 1 + 642 + 7 + 6 + 1 + 7 + 2 = 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 (164276171) 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, 524688 + ... + 525000.
Almost surely, 2164276172 is an apocalyptic number.
164276172 is a gapful number since it is divisible by the number (12) 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 164276172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212590560).
164276172 is an abundant number, since it is smaller than the sum of its proper divisors (260904948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164276172 is a wasteful number, since it uses less digits than its factorization.
164276172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 623 (or 618 counting only the distinct ones).
The product of its digits is 28224, while the sum is 36.
The square root of 164276172 is about 12817.0266442728. The cubic root of 164276172 is about 547.6774479551.
The spelling of 164276172 in words is "one hundred sixty-four million, two hundred seventy-six thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •