Search a number
-
+
155625960 = 23357319199
BaseRepresentation
bin10010100011010…
…10100111101000
3101211211121200110
421101222213220
5304320012320
623235334320
73566541000
oct1121524750
9354747613
10155625960
117a9350a6
12441513a0
132631b889
1416951000
15d9e15e0
hex946a9e8

155625960 has 256 divisors, whose sum is σ = 576000000. Its totient is φ = 33530112.

The previous prime is 155625947. The next prime is 155625961. The reversal of 155625960 is 69526551.

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 781941 + ... + 782139.

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

Almost surely, 2155625960 is an apocalyptic number.

155625960 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 155625960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (288000000).

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

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

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

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

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

The product of its (nonzero) digits is 81000, while the sum is 39.

The square root of 155625960 is about 12475.0134268465. The cubic root of 155625960 is about 537.8906739709.

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