Base | Representation |
---|---|
bin | 11110110101110111100011… |
… | …111011111011101000011111 |
3 | 122210021100202212122111221102 |
4 | 132311313203323323220133 |
5 | 120234334221144020014 |
6 | 1200253341453223315 |
7 | 40366616415011135 |
oct | 3665674373735037 |
9 | 583240685574842 |
10 | 135643186313759 |
11 | 3a246a52510a83 |
12 | 13268684791b3b |
13 | 5a8c136515357 |
14 | 256d24561b755 |
15 | 10a35cd2178de |
hex | 7b5de3efba1f |
135643186313759 has 2 divisors, whose sum is σ = 135643186313760. Its totient is φ = 135643186313758.
The previous prime is 135643186313731. The next prime is 135643186313783. The reversal of 135643186313759 is 957313681346531.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135643186313759 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135643186313695 and 135643186313704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135643186313059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67821593156879 + 67821593156880.
It is an arithmetic number, because the mean of its divisors is an integer number (67821593156880).
Almost surely, 2135643186313759 is an apocalyptic number.
135643186313759 is a deficient number, since it is larger than the sum of its proper divisors (1).
135643186313759 is an equidigital number, since it uses as much as digits as its factorization.
135643186313759 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 146966400, while the sum is 65.
The spelling of 135643186313759 in words is "one hundred thirty-five trillion, six hundred forty-three billion, one hundred eighty-six million, three hundred thirteen thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •