Base | Representation |
---|---|
bin | 10011101000111… |
… | …01011101010001 |
3 | 102111000000112001 |
4 | 21310131131101 |
5 | 314133401324 |
6 | 24203034001 |
7 | 4040220133 |
oct | 1164353521 |
9 | 374000461 |
10 | 164747089 |
11 | 84aa4a21 |
12 | 4720b901 |
13 | 281933b0 |
14 | 17c47053 |
15 | e6e3e44 |
hex | 9d1d751 |
164747089 has 4 divisors (see below), whose sum is σ = 177419956. Its totient is φ = 152074224.
The previous prime is 164747083. The next prime is 164747111. The reversal of 164747089 is 980747461.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 980747461 = 3061 ⋅320401.
It can be written as a sum of positive squares in 2 ways, for example, as 70812225 + 93934864 = 8415^2 + 9692^2 .
It is a cyclic number.
It is not a de Polignac number, because 164747089 - 27 = 164746961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (164747083) 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, 6336414 + ... + 6336439.
It is an arithmetic number, because the mean of its divisors is an integer number (44354989).
Almost surely, 2164747089 is an apocalyptic number.
It is an amenable number.
164747089 is a deficient number, since it is larger than the sum of its proper divisors (12672867).
164747089 is a wasteful number, since it uses less digits than its factorization.
164747089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12672866.
The product of its (nonzero) digits is 338688, while the sum is 46.
The square root of 164747089 is about 12835.3842560322. The cubic root of 164747089 is about 548.2002759985.
It can be divided in two parts, 164 and 747089, that added together give a triangular number (747253 = T1222).
The spelling of 164747089 in words is "one hundred sixty-four million, seven hundred forty-seven thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •