Base | Representation |
---|---|
bin | 111111100101100011… |
… | …0010010100111010011 |
3 | 111001110111120100210111 |
4 | 1333023012102213103 |
5 | 4214124130111011 |
6 | 142421510342151 |
7 | 12602604556303 |
oct | 1771306224723 |
9 | 431414510714 |
10 | 136551410131 |
11 | 52a02790574 |
12 | 2256a95a957 |
13 | cb52285886 |
14 | 6875613603 |
15 | 38430bc121 |
hex | 1fcb1929d3 |
136551410131 has 4 divisors (see below), whose sum is σ = 136604941264. Its totient is φ = 136497879000.
The previous prime is 136551410119. The next prime is 136551410189. The reversal of 136551410131 is 131014155631.
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 136551410131 - 213 = 136551401939 is a prime.
It is a super-2 number, since 2×1365514101312 (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 = 136551410093 and 136551410102.
It is not an unprimeable number, because it can be changed into a prime (136551410101) 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, 26761740 + ... + 26766841.
It is an arithmetic number, because the mean of its divisors is an integer number (34151235316).
Almost surely, 2136551410131 is an apocalyptic number.
136551410131 is a deficient number, since it is larger than the sum of its proper divisors (53531133).
136551410131 is an equidigital number, since it uses as much as digits as its factorization.
136551410131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53531132.
The product of its (nonzero) digits is 5400, while the sum is 31.
Adding to 136551410131 its reverse (131014155631), we get a palindrome (267565565762).
The spelling of 136551410131 in words is "one hundred thirty-six billion, five hundred fifty-one million, four hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •