Base | Representation |
---|---|
bin | 10011100100111… |
… | …10100000000001 |
3 | 102110000121012012 |
4 | 21302132200001 |
5 | 314020231243 |
6 | 24143542305 |
7 | 4032623063 |
oct | 1162364001 |
9 | 373017165 |
10 | 164227073 |
11 | 8477a25a |
12 | 46bba995 |
13 | 280407aa |
14 | 17b4d733 |
15 | e63ed18 |
hex | 9c9e801 |
164227073 has 2 divisors, whose sum is σ = 164227074. Its totient is φ = 164227072.
The previous prime is 164227069. The next prime is 164227103. The reversal of 164227073 is 370722461.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 158331889 + 5895184 = 12583^2 + 2428^2 .
It is an emirp because it is prime and its reverse (370722461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 164227073 - 22 = 164227069 is a prime.
It is a super-2 number, since 2×1642270732 = 53941063012294658, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (164227033) by changing a digit.
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 as a sum of consecutive naturals, namely, 82113536 + 82113537.
It is an arithmetic number, because the mean of its divisors is an integer number (82113537).
Almost surely, 2164227073 is an apocalyptic number.
It is an amenable number.
164227073 is a deficient number, since it is larger than the sum of its proper divisors (1).
164227073 is an equidigital number, since it uses as much as digits as its factorization.
164227073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14112, while the sum is 32.
The square root of 164227073 is about 12815.1111192997. Note that the first 5 decimals coincide. The cubic root of 164227073 is about 547.6228790866.
The spelling of 164227073 in words is "one hundred sixty-four million, two hundred twenty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •