Search a number
-
+
136951091200 = 2125271121579
BaseRepresentation
bin111111110001011101…
…0111101000000000000
3111002111100122021011001
41333202322331000000
54220433434404300
6142525305101344
712615530032240
oct1774272750000
9432440567131
10136951091200
1153098358900
1222660787854
13cbb7014c51
1468b2733b20
15386821b16a
hex1fe2ebd000

136951091200 has 468 divisors, whose sum is σ = 426871671520. Its totient is φ = 42659020800.

The previous prime is 136951091153. The next prime is 136951091237. The reversal of 136951091200 is 2190159631.

It is a happy number.

It is a self number, because there is not a number n which added to its sum of digits gives 136951091200.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 86732011 + ... + 86733589.

Almost surely, 2136951091200 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 37.

The spelling of 136951091200 in words is "one hundred thirty-six billion, nine hundred fifty-one million, ninety-one thousand, two hundred".