Base | Representation |
---|---|
bin | 10011101101001… |
… | …11111001010011 |
3 | 102112001211100121 |
4 | 21312213321103 |
5 | 314310023011 |
6 | 24223131111 |
7 | 4045101253 |
oct | 1166477123 |
9 | 375054317 |
10 | 165314131 |
11 | 85351a54 |
12 | 47443a97 |
13 | 28331518 |
14 | 17d53963 |
15 | e7a6e71 |
hex | 9da7e53 |
165314131 has 2 divisors, whose sum is σ = 165314132. Its totient is φ = 165314130.
The previous prime is 165314099. The next prime is 165314147. The reversal of 165314131 is 131413561.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 165314131 - 25 = 165314099 is a prime.
It is a super-2 number, since 2×1653141312 = 54657523816570322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 165314096 and 165314105.
It is not a weakly prime, because it can be changed into another prime (165314161) 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, 82657065 + 82657066.
It is an arithmetic number, because the mean of its divisors is an integer number (82657066).
Almost surely, 2165314131 is an apocalyptic number.
165314131 is a deficient number, since it is larger than the sum of its proper divisors (1).
165314131 is an equidigital number, since it uses as much as digits as its factorization.
165314131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1080, while the sum is 25.
The square root of 165314131 is about 12857.4542970216. The cubic root of 165314131 is about 548.8285048444.
Adding to 165314131 its reverse (131413561), we get a palindrome (296727692).
The spelling of 165314131 in words is "one hundred sixty-five million, three hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •