Search a number
-
+
136593072 = 243271197127
BaseRepresentation
bin10000010010000…
…11111010110000
3100112000122110200
420021003322300
5234431434242
621315355200
73246010350
oct1011037260
9315018420
10136593072
1170115440
12398b2b00
13223b6705
14141d8b60
15bed204c
hex8243eb0

136593072 has 240 divisors, whose sum is σ = 485302272. Its totient is φ = 34836480.

The previous prime is 136593047. The next prime is 136593073. The reversal of 136593072 is 270395631.

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

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

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1075473 + ... + 1075599.

Almost surely, 2136593072 is an apocalyptic number.

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

136593072 is the 7392-nd heptagonal number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 34020, while the sum is 36.

The square root of 136593072 is about 11687.3038807075. The cubic root of 136593072 is about 515.0027611628.

The spelling of 136593072 in words is "one hundred thirty-six million, five hundred ninety-three thousand, seventy-two".