Base | Representation |
---|---|
bin | 10011100011101… |
… | …00110000000100 |
3 | 102102200220121200 |
4 | 21301310300010 |
5 | 313444243233 |
6 | 24140142500 |
7 | 4031311401 |
oct | 1161646004 |
9 | 372626550 |
10 | 164056068 |
11 | 84672830 |
12 | 46b37a30 |
13 | 27cb09c7 |
14 | 17b072a8 |
15 | e609313 |
hex | 9c74c04 |
164056068 has 36 divisors (see below), whose sum is σ = 452398128. Its totient is φ = 49713840.
The previous prime is 164056043. The next prime is 164056093. The reversal of 164056068 is 860650461.
164056068 is a `hidden beast` number, since 1 + 6 + 40 + 5 + 606 + 8 = 666.
It is an interprime number because it is at equal distance from previous prime (164056043) and next prime (164056093).
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 206746 + ... + 207537.
Almost surely, 2164056068 is an apocalyptic number.
164056068 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
164056068 is an abundant number, since it is smaller than the sum of its proper divisors (288342060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164056068 is a wasteful number, since it uses less digits than its factorization.
164056068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414304 (or 414299 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 164056068 is about 12808.4373754178. The cubic root of 164056068 is about 547.4327383437.
The spelling of 164056068 in words is "one hundred sixty-four million, fifty-six thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •