Base | Representation |
---|---|
bin | 10011100111000… |
… | …10101000010101 |
3 | 102110112202222202 |
4 | 21303202220111 |
5 | 314103144013 |
6 | 24153534245 |
7 | 4035164501 |
oct | 1163425025 |
9 | 373482882 |
10 | 164506133 |
11 | 8494a990 |
12 | 47114385 |
13 | 2810a80c |
14 | 17bc3301 |
15 | e697858 |
hex | 9ce2a15 |
164506133 has 8 divisors (see below), whose sum is σ = 179555616. Its totient is φ = 149472400.
The previous prime is 164506129. The next prime is 164506151. The reversal of 164506133 is 331605461.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 164506133 - 22 = 164506129 is a prime.
It is a super-2 number, since 2×1645061332 = 54124535589227378, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 164506096 and 164506105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164506103) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 33110 + ... + 37752.
It is an arithmetic number, because the mean of its divisors is an integer number (22444452).
Almost surely, 2164506133 is an apocalyptic number.
It is an amenable number.
164506133 is a deficient number, since it is larger than the sum of its proper divisors (15049483).
164506133 is a wasteful number, since it uses less digits than its factorization.
164506133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7875.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 164506133 is about 12825.9944253847. The cubic root of 164506133 is about 547.9328831169.
The spelling of 164506133 in words is "one hundred sixty-four million, five hundred six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •