Base | Representation |
---|---|
bin | 11110110101100011001101… |
… | …100111100011100101010101 |
3 | 122210012021101011101021002002 |
4 | 132311203031213203211111 |
5 | 120234004444240142031 |
6 | 1200235325423325045 |
7 | 40365214106144204 |
oct | 3665431547434525 |
9 | 583167334337062 |
10 | 135621337037141 |
11 | 3a23876013107a |
12 | 132643a7450785 |
13 | 5a8a0639865c7 |
14 | 256c1718b323b |
15 | 10a2c4ee5cccb |
hex | 7b58cd9e3955 |
135621337037141 has 2 divisors, whose sum is σ = 135621337037142. Its totient is φ = 135621337037140.
The previous prime is 135621337037089. The next prime is 135621337037167. The reversal of 135621337037141 is 141730733126531.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108335914670116 + 27285422367025 = 10408454^2 + 5223545^2 .
It is an emirp because it is prime and its reverse (141730733126531) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135621337037141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135621337037341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67810668518570 + 67810668518571.
It is an arithmetic number, because the mean of its divisors is an integer number (67810668518571).
Almost surely, 2135621337037141 is an apocalyptic number.
It is an amenable number.
135621337037141 is a deficient number, since it is larger than the sum of its proper divisors (1).
135621337037141 is an equidigital number, since it uses as much as digits as its factorization.
135621337037141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 952560, while the sum is 47.
The spelling of 135621337037141 in words is "one hundred thirty-five trillion, six hundred twenty-one billion, three hundred thirty-seven million, thirty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •