Base | Representation |
---|---|
bin | 11110110110011101101100… |
… | …111001100001100111010101 |
3 | 122210102021110221002210001101 |
4 | 132312131230321201213111 |
5 | 120241022104022222112 |
6 | 1200324233300430101 |
7 | 40402566306661426 |
oct | 3666355471414725 |
9 | 583367427083041 |
10 | 135684138867157 |
11 | 3a262358126531 |
12 | 132745b36a8331 |
13 | 5a92c61a3197a |
14 | 257120c50564d |
15 | 10a46c865c757 |
hex | 7b676ce619d5 |
135684138867157 has 2 divisors, whose sum is σ = 135684138867158. Its totient is φ = 135684138867156.
The previous prime is 135684138867097. The next prime is 135684138867161. The reversal of 135684138867157 is 751768831486531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122279563044081 + 13404575823076 = 11058009^2 + 3661226^2 .
It is a cyclic number.
It is not a de Polignac number, because 135684138867157 - 211 = 135684138865109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135684138867157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135684138867257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67842069433578 + 67842069433579.
It is an arithmetic number, because the mean of its divisors is an integer number (67842069433579).
Almost surely, 2135684138867157 is an apocalyptic number.
It is an amenable number.
135684138867157 is a deficient number, since it is larger than the sum of its proper divisors (1).
135684138867157 is an equidigital number, since it uses as much as digits as its factorization.
135684138867157 is an evil number, because the sum of its binary digits is even.
The product of its digits is 812851200, while the sum is 73.
The spelling of 135684138867157 in words is "one hundred thirty-five trillion, six hundred eighty-four billion, one hundred thirty-eight million, eight hundred sixty-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •