Base | Representation |
---|---|
bin | 10011101000001… |
… | …10100000000001 |
3 | 102110211020112101 |
4 | 21310012200001 |
5 | 314122344212 |
6 | 24201030401 |
7 | 4036346032 |
oct | 1164064001 |
9 | 373736471 |
10 | 164653057 |
11 | 84a40308 |
12 | 47185401 |
13 | 2815c65a |
14 | 17c20a89 |
15 | e6c6157 |
hex | 9d06801 |
164653057 has 4 divisors (see below), whose sum is σ = 164878420. Its totient is φ = 164427696.
The previous prime is 164653051. The next prime is 164653081. The reversal of 164653057 is 750356461.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 750356461 = 991 ⋅757171.
It can be written as a sum of positive squares in 2 ways, for example, as 161569521 + 3083536 = 12711^2 + 1756^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-164653057 is a prime.
It is a super-2 number, since 2×1646530572 = 54221258358890498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (164653051) 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, 111582 + ... + 113047.
It is an arithmetic number, because the mean of its divisors is an integer number (41219605).
Almost surely, 2164653057 is an apocalyptic number.
It is an amenable number.
164653057 is a deficient number, since it is larger than the sum of its proper divisors (225363).
164653057 is an equidigital number, since it uses as much as digits as its factorization.
164653057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225362.
The product of its (nonzero) digits is 75600, while the sum is 37.
The square root of 164653057 is about 12831.7207341806. The cubic root of 164653057 is about 548.0959581637.
The spelling of 164653057 in words is "one hundred sixty-four million, six hundred fifty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •