Base | Representation |
---|---|
bin | 11110110101010101100001… |
… | …000000101101010010001001 |
3 | 122210010212102012111222101202 |
4 | 132311111201000231102021 |
5 | 120233234334240341131 |
6 | 1200224454212553545 |
7 | 40364153464405046 |
oct | 3665254100552211 |
9 | 583125365458352 |
10 | 135606630012041 |
11 | 3a2324a3425481 |
12 | 132615820228b5 |
13 | 5a8885ba488a6 |
14 | 256b5785541cd |
15 | 10a268dc1abcb |
hex | 7b556102d489 |
135606630012041 has 2 divisors, whose sum is σ = 135606630012042. Its totient is φ = 135606630012040.
The previous prime is 135606630011953. The next prime is 135606630012047. The reversal of 135606630012041 is 140210036606531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128291958172816 + 7314671839225 = 11326604^2 + 2704565^2 .
It is a cyclic number.
It is not a de Polignac number, because 135606630012041 - 234 = 135589450142857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135606630011986 and 135606630012004.
It is not a weakly prime, because it can be changed into another prime (135606630012047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67803315006020 + 67803315006021.
It is an arithmetic number, because the mean of its divisors is an integer number (67803315006021).
Almost surely, 2135606630012041 is an apocalyptic number.
It is an amenable number.
135606630012041 is a deficient number, since it is larger than the sum of its proper divisors (1).
135606630012041 is an equidigital number, since it uses as much as digits as its factorization.
135606630012041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 38.
Adding to 135606630012041 its reverse (140210036606531), we get a palindrome (275816666618572).
The spelling of 135606630012041 in words is "one hundred thirty-five trillion, six hundred six billion, six hundred thirty million, twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •