Base | Representation |
---|---|
bin | 111111011001100111… |
… | …1010011100100000011 |
3 | 111000102121100112010221 |
4 | 1332303033103210003 |
5 | 4212314141321011 |
6 | 142314051003511 |
7 | 12556644266125 |
oct | 1766317234403 |
9 | 430377315127 |
10 | 136151120131 |
11 | 52817837794 |
12 | 22478899597 |
13 | caba3722a0 |
14 | 68383b5215 |
15 | 381cd9c971 |
hex | 1fb33d3903 |
136151120131 has 4 divisors (see below), whose sum is σ = 146624283232. Its totient is φ = 125677957032.
The previous prime is 136151120093. The next prime is 136151120141. The reversal of 136151120131 is 131021151631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 136151120131 - 223 = 136142731523 is a prime.
It is a super-2 number, since 2×1361511201312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136151120096 and 136151120105.
It is not an unprimeable number, because it can be changed into a prime (136151120141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5236581531 + ... + 5236581556.
It is an arithmetic number, because the mean of its divisors is an integer number (36656070808).
Almost surely, 2136151120131 is an apocalyptic number.
136151120131 is a deficient number, since it is larger than the sum of its proper divisors (10473163101).
136151120131 is a wasteful number, since it uses less digits than its factorization.
136151120131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10473163100.
The product of its (nonzero) digits is 540, while the sum is 25.
Adding to 136151120131 its reverse (131021151631), we get a palindrome (267172271762).
The spelling of 136151120131 in words is "one hundred thirty-six billion, one hundred fifty-one million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •