Base | Representation |
---|---|
bin | 10000001101101… |
… | …01110100010111 |
3 | 100110221002001121 |
4 | 20012311310113 |
5 | 234304323111 |
6 | 21255104411 |
7 | 3241034422 |
oct | 1006656427 |
9 | 313832047 |
10 | 136011031 |
11 | 6a858112 |
12 | 39672107 |
13 | 22241800 |
14 | 140c69b9 |
15 | be19871 |
hex | 81b5d17 |
136011031 has 12 divisors (see below), whose sum is σ = 148461312. Its totient is φ = 124540416.
The previous prime is 136011019. The next prime is 136011041. The reversal of 136011031 is 130110631.
136011031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 136011031 - 227 = 1793303 is a prime.
It is a super-2 number, since 2×1360110312 = 36998001107365922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136010996 and 136011014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136011011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18295 + ... + 24631.
It is an arithmetic number, because the mean of its divisors is an integer number (12371776).
Almost surely, 2136011031 is an apocalyptic number.
136011031 is a deficient number, since it is larger than the sum of its proper divisors (12450281).
136011031 is a wasteful number, since it uses less digits than its factorization.
136011031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6490 (or 6477 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 136011031 is about 11662.3767303239. The cubic root of 136011031 is about 514.2702215828.
Adding to 136011031 its reverse (130110631), we get a palindrome (266121662).
The spelling of 136011031 in words is "one hundred thirty-six million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •