Base | Representation |
---|---|
bin | 11110110101100111011010… |
… | …110000000111000001011111 |
3 | 122210012201000211201221122101 |
4 | 132311213122300013001133 |
5 | 120234043221200204214 |
6 | 1200241353442225531 |
7 | 40365434024524234 |
oct | 3665473260070137 |
9 | 583181024657571 |
10 | 135625852350559 |
11 | 3a23a66799095a |
12 | 132652476552a7 |
13 | 5a8a6032922ac |
14 | 256c47d44778b |
15 | 10a2e16573774 |
hex | 7b59dac0705f |
135625852350559 has 2 divisors, whose sum is σ = 135625852350560. Its totient is φ = 135625852350558.
The previous prime is 135625852350557. The next prime is 135625852350697. The reversal of 135625852350559 is 955053258526531.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 135625852350559 - 21 = 135625852350557 is a prime.
It is a super-2 number, since 2×1356258523505592 (a number of 29 digits) contains 22 as substring.
Together with 135625852350557, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 135625852350559.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135625852350551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67812926175279 + 67812926175280.
It is an arithmetic number, because the mean of its divisors is an integer number (67812926175280).
Almost surely, 2135625852350559 is an apocalyptic number.
135625852350559 is a deficient number, since it is larger than the sum of its proper divisors (1).
135625852350559 is an equidigital number, since it uses as much as digits as its factorization.
135625852350559 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243000000, while the sum is 64.
The spelling of 135625852350559 in words is "one hundred thirty-five trillion, six hundred twenty-five billion, eight hundred fifty-two million, three hundred fifty thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •