Search a number
-
+
165150025600 = 2752759312433
BaseRepresentation
bin1001100111001110110…
…1010110011110000000
3120210021120220112222211
42121303231112132000
510201211401304400
6203511402111504
714634400025050
oct2316355263600
9523246815884
10165150025600
116404897a66a
12280104ab594
131275c205c51
147dc98a9560
154468b7adba
hex2673b56780

165150025600 has 192 divisors, whose sum is σ = 467077739040. Its totient is φ = 56522833920.

The previous prime is 165150025559. The next prime is 165150025627. The reversal of 165150025600 is 6520051561.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13276984 + ... + 13289416.

Almost surely, 2165150025600 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 165150025600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (233538869520).

165150025600 is an abundant number, since it is smaller than the sum of its proper divisors (301927713440).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 9000, while the sum is 31.

The spelling of 165150025600 in words is "one hundred sixty-five billion, one hundred fifty million, twenty-five thousand, six hundred".