Search a number
-
+
165560600675150 = 2525910915722914321
BaseRepresentation
bin100101101001001110010100…
…110010101100001101001110
3210201012102211220220011001122
4211221032110302230031032
5133200021102233101100
61344041253455440542
746605234011150642
oct4551162462541516
9721172756804048
10165560600675150
1148830946a1a43a
121669a906226152
13714c3b3c37605
142cc5266688c22
151421927a2c985
hex969394cac34e

165560600675150 has 192 divisors, whose sum is σ = 319459256424000. Its totient is φ = 63809333452800.

The previous prime is 165560600675149. The next prime is 165560600675161. The reversal of 165560600675150 is 51576006065561.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 165560600675092 and 165560600675101.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 11560679990 + ... + 11560694310.

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

Almost surely, 2165560600675150 is an apocalyptic number.

165560600675150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 14887 (or 14882 counting only the distinct ones).

The product of its (nonzero) digits is 5670000, while the sum is 53.

The spelling of 165560600675150 in words is "one hundred sixty-five trillion, five hundred sixty billion, six hundred million, six hundred seventy-five thousand, one hundred fifty".