Search a number
-
+
136503915000 = 2335437419587
BaseRepresentation
bin111111100100001000…
…1000111000111111000
3111001100012012100201120
41333020101013013320
54214030000240000
6142413052345240
712601460063445
oct1771021070770
9431305170646
10136503915000
11529889a07a2
1222556a75220
13cb4549664b
14686d1ac9cc
15383dd396a0
hex1fc84471f8

136503915000 has 320 divisors, whose sum is σ = 439756732800. Its totient is φ = 35272512000.

The previous prime is 136503914941. The next prime is 136503915029. The reversal of 136503915000 is 519305631.

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 79 ways as a sum of consecutive naturals, for example, 232544707 + ... + 232545293.

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

Almost surely, 2136503915000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 12150, while the sum is 33.

The spelling of 136503915000 in words is "one hundred thirty-six billion, five hundred three million, nine hundred fifteen thousand".