Base | Representation |
---|---|
bin | 10011101010010… |
… | …01011010100101 |
3 | 102111100011111122 |
4 | 21311021122211 |
5 | 314210132031 |
6 | 24210543325 |
7 | 4041600101 |
oct | 1165113245 |
9 | 374304448 |
10 | 164927141 |
11 | 85108225 |
12 | 47297b45 |
13 | 28227332 |
14 | 17c92901 |
15 | e72c47b |
hex | 9d496a5 |
164927141 has 4 divisors (see below), whose sum is σ = 165120000. Its totient is φ = 164734284.
The previous prime is 164927131. The next prime is 164927159. The reversal of 164927141 is 141729461.
164927141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141729461 = 1579 ⋅89759.
It is a cyclic number.
It is not a de Polignac number, because 164927141 - 226 = 97818277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164927101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95141 + ... + 96858.
It is an arithmetic number, because the mean of its divisors is an integer number (41280000).
Almost surely, 2164927141 is an apocalyptic number.
It is an amenable number.
164927141 is a deficient number, since it is larger than the sum of its proper divisors (192859).
164927141 is an equidigital number, since it uses as much as digits as its factorization.
164927141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 192858.
The product of its digits is 12096, while the sum is 35.
The square root of 164927141 is about 12842.3962327908. The cubic root of 164927141 is about 548.3999125453.
The spelling of 164927141 in words is "one hundred sixty-four million, nine hundred twenty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •