Base | Representation |
---|---|
bin | 10011101101100… |
… | …00111010000001 |
3 | 102112010200222122 |
4 | 21312300322001 |
5 | 314312213131 |
6 | 24224014025 |
7 | 4045314002 |
oct | 1166607201 |
9 | 375120878 |
10 | 165351041 |
11 | 85377759 |
12 | 47461315 |
13 | 2834526b |
14 | 17d631a9 |
15 | e7b2d7b |
hex | 9db0e81 |
165351041 has 2 divisors, whose sum is σ = 165351042. Its totient is φ = 165351040.
The previous prime is 165351037. The next prime is 165351047. The reversal of 165351041 is 140153561.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 156375025 + 8976016 = 12505^2 + 2996^2 .
It is a cyclic number.
It is not a de Polignac number, because 165351041 - 22 = 165351037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 165351041.
It is not a weakly prime, because it can be changed into another prime (165351047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82675520 + 82675521.
It is an arithmetic number, because the mean of its divisors is an integer number (82675521).
Almost surely, 2165351041 is an apocalyptic number.
It is an amenable number.
165351041 is a deficient number, since it is larger than the sum of its proper divisors (1).
165351041 is an equidigital number, since it uses as much as digits as its factorization.
165351041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 165351041 is about 12858.8895710322. The cubic root of 165351041 is about 548.8693477990.
It can be divided in two parts, 16535 and 1041, that added together give a cube (17576 = 263).
The spelling of 165351041 in words is "one hundred sixty-five million, three hundred fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •