Search a number
-
+
136010361 = 3311462477
BaseRepresentation
bin10000001101101…
…01101001111001
3100110221001010210
420012311221321
5234304312421
621255101333
73241032444
oct1006655171
9313831123
10136010361
116a857663
1239671849
1322241406
14140c665b
15be19576
hex81b5a79

136010361 has 8 divisors (see below), whose sum is σ = 187197184. Its totient is φ = 87748560.

The previous prime is 136010327. The next prime is 136010363. The reversal of 136010361 is 163010631.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 136010361 - 213 = 136002169 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2136010361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1462511.

The product of its (nonzero) digits is 324, while the sum is 21.

The square root of 136010361 is about 11662.3480054404. The cubic root of 136010361 is about 514.2693771376.

Adding to 136010361 its reverse (163010631), we get a palindrome (299020992).

The spelling of 136010361 in words is "one hundred thirty-six million, ten thousand, three hundred sixty-one".

Divisors: 1 3 31 93 1462477 4387431 45336787 136010361