Search a number
-
+
165375490127 = 2591522712211
BaseRepresentation
bin1001101000000100100…
…1011011100001001111
3120210212022011100011212
42122001021123201033
510202142111141002
6203550014405035
714643105321041
oct2320111334117
9523768140155
10165375490127
1164154175491
1228073b0077b
1312796b37a03
14800b7d9a91
15447d865352
hex268125b84f

165375490127 has 8 divisors (see below), whose sum is σ = 165484518912. Its totient is φ = 165266501400.

The previous prime is 165375490109. The next prime is 165375490177. The reversal of 165375490127 is 721094573561.

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

It is a cyclic number.

It is not a de Polignac number, because 165375490127 - 226 = 165308381263 is a prime.

It is a super-2 number, since 2×1653754901272 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (165375490177) 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, 13537052 + ... + 13549262.

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

Almost surely, 2165375490127 is an apocalyptic number.

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

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

165375490127 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 20029.

The product of its (nonzero) digits is 1587600, while the sum is 50.

The spelling of 165375490127 in words is "one hundred sixty-five billion, three hundred seventy-five million, four hundred ninety thousand, one hundred twenty-seven".

Divisors: 1 2591 5227 12211 13543157 31638701 63826897 165375490127