Search a number
-
+
136407011520 = 26351326831231
BaseRepresentation
bin111111100001001111…
…1011101000011000000
3111001002102212011010210
41333002133131003000
54213330143332040
6142355311354120
712566202316143
oct1770237350300
9431072764123
10136407011520
115293922477a
122252a522940
13cb2b398400
14686038605a
153835597480
hex1fc27dd0c0

136407011520 has 336 divisors, whose sum is σ = 470037883392. Its totient is φ = 33500712960.

The previous prime is 136407011473. The next prime is 136407011561. The reversal of 136407011520 is 25110704631.

It is a Harshad number since it is a multiple of its sum of digits (30).

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 47 ways as a sum of consecutive naturals, for example, 110809305 + ... + 110810535.

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

Almost surely, 2136407011520 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 5040, while the sum is 30.

The spelling of 136407011520 in words is "one hundred thirty-six billion, four hundred seven million, eleven thousand, five hundred twenty".