Base | Representation |
---|---|
bin | 10000010011111… |
… | …10001111000001 |
3 | 100112110210010112 |
4 | 20021332033001 |
5 | 240012110222 |
6 | 21324441105 |
7 | 3251023634 |
oct | 1011761701 |
9 | 315423115 |
10 | 136831937 |
11 | 70268950 |
12 | 399a9195 |
13 | 2246b358 |
14 | 1425bc1b |
15 | c02cbe2 |
hex | 827e3c1 |
136831937 has 8 divisors (see below), whose sum is σ = 150223872. Its totient is φ = 123598800.
The previous prime is 136831931. The next prime is 136831943. The reversal of 136831937 is 739138631.
It is an interprime number because it is at equal distance from previous prime (136831931) and next prime (136831943).
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 136831937 - 26 = 136831873 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136831894 and 136831903.
It is not an unprimeable number, because it can be changed into a prime (136831931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37889 + ... + 41342.
It is an arithmetic number, because the mean of its divisors is an integer number (18777984).
Almost surely, 2136831937 is an apocalyptic number.
It is an amenable number.
136831937 is a deficient number, since it is larger than the sum of its proper divisors (13391935).
136831937 is a wasteful number, since it uses less digits than its factorization.
136831937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79399.
The product of its digits is 81648, while the sum is 41.
The square root of 136831937 is about 11697.5184120394. The cubic root of 136831937 is about 515.3027873521.
The spelling of 136831937 in words is "one hundred thirty-six million, eight hundred thirty-one thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •