Base | Representation |
---|---|
bin | 10000010101000… |
… | …00001110110011 |
3 | 100112201212010221 |
4 | 20022200032303 |
5 | 240031034222 |
6 | 21331433511 |
7 | 3252143623 |
oct | 1012401663 |
9 | 315655127 |
10 | 136971187 |
11 | 70353531 |
12 | 39a55897 |
13 | 224b9852 |
14 | 14296883 |
15 | c0590c7 |
hex | 82a03b3 |
136971187 has 8 divisors (see below), whose sum is σ = 143080704. Its totient is φ = 130874568.
The previous prime is 136971161. The next prime is 136971203. The reversal of 136971187 is 781179631.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 136971187 - 27 = 136971059 is a prime.
It is a super-2 number, since 2×1369711872 = 37522212136377938, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136971127) 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, 23178 + ... + 28480.
It is an arithmetic number, because the mean of its divisors is an integer number (17885088).
Almost surely, 2136971187 is an apocalyptic number.
136971187 is a deficient number, since it is larger than the sum of its proper divisors (6109517).
136971187 is a wasteful number, since it uses less digits than its factorization.
136971187 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6449.
The product of its digits is 63504, while the sum is 43.
The square root of 136971187 is about 11703.4690156381. The cubic root of 136971187 is about 515.4775311220.
It can be divided in two parts, 13697 and 1187, that added together give a square (14884 = 1222).
The spelling of 136971187 in words is "one hundred thirty-six million, nine hundred seventy-one thousand, one hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •