Base | Representation |
---|---|
bin | 10011101101111… |
… | …01111001010001 |
3 | 102112020101222000 |
4 | 21312331321101 |
5 | 314320413431 |
6 | 24225104213 |
7 | 4045625052 |
oct | 1166757121 |
9 | 375211860 |
10 | 165404241 |
11 | 85403722 |
12 | 47488069 |
13 | 28363542 |
14 | 17d78729 |
15 | e7c39e6 |
hex | 9dbde51 |
165404241 has 8 divisors (see below), whose sum is σ = 245043360. Its totient is φ = 110269476.
The previous prime is 165404191. The next prime is 165404249. The reversal of 165404241 is 142404561.
165404241 is a `hidden beast` number, since 1 + 654 + 0 + 4 + 2 + 4 + 1 = 666.
It is not a de Polignac number, because 165404241 - 214 = 165387857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 6126083 = 165404241 / (1 + 6 + 5 + 4 + 0 + 4 + 2 + 4 + 1).
It is not an unprimeable number, because it can be changed into a prime (165404249) 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 in 7 ways as a sum of consecutive naturals, for example, 3063015 + ... + 3063068.
It is an arithmetic number, because the mean of its divisors is an integer number (30630420).
Almost surely, 2165404241 is an apocalyptic number.
It is an amenable number.
165404241 is a deficient number, since it is larger than the sum of its proper divisors (79639119).
165404241 is an equidigital number, since it uses as much as digits as its factorization.
165404241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6126092 (or 6126086 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 165404241 is about 12860.9580125277. The cubic root of 165404241 is about 548.9282058466.
The spelling of 165404241 in words is "one hundred sixty-five million, four hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •