Base | Representation |
---|---|
bin | 10011101110001… |
… | …11000001101001 |
3 | 102112022022021012 |
4 | 21313013001221 |
5 | 314323113031 |
6 | 24225553305 |
7 | 4046142101 |
oct | 1167070151 |
9 | 375268235 |
10 | 165441641 |
11 | 85429832 |
12 | 474a5835 |
13 | 28377581 |
14 | 17d88201 |
15 | e7ceb2b |
hex | 9dc7069 |
165441641 has 2 divisors, whose sum is σ = 165441642. Its totient is φ = 165441640.
The previous prime is 165441631. The next prime is 165441643. The reversal of 165441641 is 146144561.
165441641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101505625 + 63936016 = 10075^2 + 7996^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-165441641 is a prime.
It is a Sophie Germain prime.
Together with 165441643, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 165441598 and 165441607.
It is not a weakly prime, because it can be changed into another prime (165441643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82720820 + 82720821.
It is an arithmetic number, because the mean of its divisors is an integer number (82720821).
Almost surely, 2165441641 is an apocalyptic number.
It is an amenable number.
165441641 is a deficient number, since it is larger than the sum of its proper divisors (1).
165441641 is an equidigital number, since it uses as much as digits as its factorization.
165441641 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11520, while the sum is 32.
The square root of 165441641 is about 12862.4119433332. The cubic root of 165441641 is about 548.9695759420.
The spelling of 165441641 in words is "one hundred sixty-five million, four hundred forty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •