Search a number
-
+
136015690 = 25101134669
BaseRepresentation
bin10000001101101…
…10111101001010
3100110221022110011
420012312331022
5234310000230
621255142134
73241054126
oct1006667512
9313838404
10136015690
116a860668
123967494a
1322243975
14140c8586
15be1ae2a
hex81b6f4a

136015690 has 16 divisors (see below), whose sum is σ = 247254120. Its totient is φ = 53867200.

The previous prime is 136015681. The next prime is 136015703. The reversal of 136015690 is 96510631.

136015690 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 134119561 + 1896129 = 11581^2 + 1377^2 .

It is a super-2 number, since 2×1360156902 = 37000535852352200, which contains 22 as substring.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66325 + ... + 68344.

Almost surely, 2136015690 is an apocalyptic number.

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

136015690 is a deficient number, since it is larger than the sum of its proper divisors (111238430).

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

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

The sum of its prime factors is 134777.

The product of its (nonzero) digits is 4860, while the sum is 31.

The square root of 136015690 is about 11662.5764734899. The cubic root of 136015690 is about 514.2760935517.

It can be divided in two parts, 13601 and 5690, that added together give a palindrome (19291).

The spelling of 136015690 in words is "one hundred thirty-six million, fifteen thousand, six hundred ninety".

Divisors: 1 2 5 10 101 202 505 1010 134669 269338 673345 1346690 13601569 27203138 68007845 136015690