Search a number
-
+
136200251 = 1161202981
BaseRepresentation
bin10000001111001…
…00000000111011
3100111021200121202
420013210000323
5234331402001
621303124415
73242453165
oct1007440073
9314250552
10136200251
116a9772a0
123974370b
13222a9985
1414135935
15be5596b
hex81e403b

136200251 has 8 divisors (see below), whose sum is σ = 151018608. Its totient is φ = 121788000.

The previous prime is 136200199. The next prime is 136200257. The reversal of 136200251 is 152002631.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-136200251 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (136200257) 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 7 ways as a sum of consecutive naturals, for example, 100820 + ... + 102161.

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

Almost surely, 2136200251 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 203053.

The product of its (nonzero) digits is 360, while the sum is 20.

The square root of 136200251 is about 11670.4863223432. The cubic root of 136200251 is about 514.5085971497.

Adding to 136200251 its reverse (152002631), we get a palindrome (288202882).

The spelling of 136200251 in words is "one hundred thirty-six million, two hundred thousand, two hundred fifty-one".

Divisors: 1 11 61 671 202981 2232791 12381841 136200251