Base | Representation |
---|---|
bin | 11110110110000000101111… |
… | …101100001110101110101011 |
3 | 122210022022020002122110210122 |
4 | 132312000233230032232223 |
5 | 120240014420040410213 |
6 | 1200302052150233455 |
7 | 40400415653115455 |
oct | 3666005754165653 |
9 | 583268202573718 |
10 | 135653047200683 |
11 | 3a25015274a301 |
12 | 1326a57705588b |
13 | 5a9004844609c |
14 | 256d8dd0cb2d5 |
15 | 10a39a8c96d08 |
hex | 7b602fb0ebab |
135653047200683 has 2 divisors, whose sum is σ = 135653047200684. Its totient is φ = 135653047200682.
The previous prime is 135653047200659. The next prime is 135653047200691. The reversal of 135653047200683 is 386002740356531.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135653047200683 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (135653047203683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67826523600341 + 67826523600342.
It is an arithmetic number, because the mean of its divisors is an integer number (67826523600342).
Almost surely, 2135653047200683 is an apocalyptic number.
135653047200683 is a deficient number, since it is larger than the sum of its proper divisors (1).
135653047200683 is an equidigital number, since it uses as much as digits as its factorization.
135653047200683 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10886400, while the sum is 53.
The spelling of 135653047200683 in words is "one hundred thirty-five trillion, six hundred fifty-three billion, forty-seven million, two hundred thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •