Base | Representation |
---|---|
bin | 111111101000110100… |
… | …0011100001111010101 |
3 | 111001202010211102011012 |
4 | 1333101220130033111 |
5 | 4214340210310444 |
6 | 142440424022005 |
7 | 12605405360333 |
oct | 1772150341725 |
9 | 431663742135 |
10 | 136661025749 |
11 | 52a5964a396 |
12 | 2259b601905 |
13 | cb6bbb4ca1 |
14 | 6885dc8b53 |
15 | 384ca20b9e |
hex | 1fd1a1c3d5 |
136661025749 has 2 divisors, whose sum is σ = 136661025750. Its totient is φ = 136661025748.
The previous prime is 136661025737. The next prime is 136661025751. The reversal of 136661025749 is 947520166631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123494610724 + 13166415025 = 351418^2 + 114745^2 .
It is a cyclic number.
It is not a de Polignac number, because 136661025749 - 28 = 136661025493 is a prime.
It is a super-2 number, since 2×1366610257492 (a number of 23 digits) contains 22 as substring.
Together with 136661025751, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 136661025697 and 136661025706.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136661025349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68330512874 + 68330512875.
It is an arithmetic number, because the mean of its divisors is an integer number (68330512875).
Almost surely, 2136661025749 is an apocalyptic number.
It is an amenable number.
136661025749 is a deficient number, since it is larger than the sum of its proper divisors (1).
136661025749 is an equidigital number, since it uses as much as digits as its factorization.
136661025749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 50.
The spelling of 136661025749 in words is "one hundred thirty-six billion, six hundred sixty-one million, twenty-five thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •