Base | Representation |
---|---|
bin | 10011101110011… |
… | …11001110001101 |
3 | 102112101000022121 |
4 | 21313033032031 |
5 | 314330201323 |
6 | 24230412541 |
7 | 4046342011 |
oct | 1167171615 |
9 | 375330277 |
10 | 165475213 |
11 | 85451a82 |
12 | 47501151 |
13 | 28389937 |
14 | 17d96541 |
15 | e7d9a5d |
hex | 9dcf38d |
165475213 has 2 divisors, whose sum is σ = 165475214. Its totient is φ = 165475212.
The previous prime is 165475201. The next prime is 165475253. The reversal of 165475213 is 312574561.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 164814244 + 660969 = 12838^2 + 813^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-165475213 is a prime.
It is a super-2 number, since 2×1654752132 = 54764092234790738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (165475253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82737606 + 82737607.
It is an arithmetic number, because the mean of its divisors is an integer number (82737607).
Almost surely, 2165475213 is an apocalyptic number.
It is an amenable number.
165475213 is a deficient number, since it is larger than the sum of its proper divisors (1).
165475213 is an equidigital number, since it uses as much as digits as its factorization.
165475213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25200, while the sum is 34.
The square root of 165475213 is about 12863.7169200818. The cubic root of 165475213 is about 549.0067063767.
It can be divided in two parts, 1654 and 75213, that added together give a palindrome (76867).
The spelling of 165475213 in words is "one hundred sixty-five million, four hundred seventy-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •