Base | Representation |
---|---|
bin | 10011100101111… |
… | …00110011101110 |
3 | 102110020220111000 |
4 | 21302330303232 |
5 | 314033214324 |
6 | 24150341130 |
7 | 4033651026 |
oct | 1162746356 |
9 | 373226430 |
10 | 164351214 |
11 | 84854555 |
12 | 4705a7a6 |
13 | 28085151 |
14 | 17b82a86 |
15 | e6669c9 |
hex | 9cbccee |
164351214 has 16 divisors (see below), whose sum is σ = 365225040. Its totient is φ = 54783720.
The previous prime is 164351183. The next prime is 164351219. The reversal of 164351214 is 412153461.
It is a happy number.
164351214 is a `hidden beast` number, since 1 + 643 + 5 + 1 + 2 + 14 = 666.
It is a super-2 number, since 2×1643512142 = 54022643086547592, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164351219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1521717 + ... + 1521824.
It is an arithmetic number, because the mean of its divisors is an integer number (22826565).
Almost surely, 2164351214 is an apocalyptic number.
164351214 is an abundant number, since it is smaller than the sum of its proper divisors (200873826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164351214 is a wasteful number, since it uses less digits than its factorization.
164351214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3043552 (or 3043546 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 164351214 is about 12819.9537440663. The cubic root of 164351214 is about 547.7608289959.
The spelling of 164351214 in words is "one hundred sixty-four million, three hundred fifty-one thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •