Search a number
-
+
165044913 = 3115001361
BaseRepresentation
bin10011101011001…
…10001010110001
3102111120011001120
421311212022301
5314222414123
624213252453
74042600335
oct1165461261
9374504046
10165044913
1185188760
1247334129
1328268b17
1417cc37c5
15e7522e3
hex9d662b1

165044913 has 8 divisors (see below), whose sum is σ = 240065376. Its totient is φ = 100027200.

The previous prime is 165044911. The next prime is 165044917. The reversal of 165044913 is 319440561.

165044913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 165044913 - 21 = 165044911 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 5001361 = 165044913 / (1 + 6 + 5 + 0 + 4 + 4 + 9 + 1 + 3).

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (165044911) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2500648 + ... + 2500713.

It is an arithmetic number, because the mean of its divisors is an integer number (30008172).

Almost surely, 2165044913 is an apocalyptic number.

It is an amenable number.

165044913 is a deficient number, since it is larger than the sum of its proper divisors (75020463).

165044913 is a wasteful number, since it uses less digits than its factorization.

165044913 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 5001375.

The product of its (nonzero) digits is 12960, while the sum is 33.

The square root of 165044913 is about 12846.9806958678. The cubic root of 165044913 is about 548.5304162067.

The spelling of 165044913 in words is "one hundred sixty-five million, forty-four thousand, nine hundred thirteen".

Divisors: 1 3 11 33 5001361 15004083 55014971 165044913