Base | Representation |
---|---|
bin | 10000001011010… |
… | …01011101110101 |
3 | 100110100012001201 |
4 | 20011221131311 |
5 | 234214321133 |
6 | 21244252501 |
7 | 3235262563 |
oct | 1005513565 |
9 | 313305051 |
10 | 135698293 |
11 | 6a664155 |
12 | 39541131 |
13 | 22162363 |
14 | 14044a33 |
15 | bda6d7d |
hex | 8169775 |
135698293 has 2 divisors, whose sum is σ = 135698294. Its totient is φ = 135698292.
The previous prime is 135698291. The next prime is 135698309. The reversal of 135698293 is 392896531.
It is a happy number.
135698293 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115068529 + 20629764 = 10727^2 + 4542^2 .
It is a cyclic number.
It is not a de Polignac number, because 135698293 - 21 = 135698291 is a prime.
It is a super-2 number, since 2×1356982932 = 36828053446227698, which contains 22 as substring.
Together with 135698291, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135698291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67849146 + 67849147.
It is an arithmetic number, because the mean of its divisors is an integer number (67849147).
Almost surely, 2135698293 is an apocalyptic number.
It is an amenable number.
135698293 is a deficient number, since it is larger than the sum of its proper divisors (1).
135698293 is an equidigital number, since it uses as much as digits as its factorization.
135698293 is an evil number, because the sum of its binary digits is even.
The product of its digits is 349920, while the sum is 46.
The square root of 135698293 is about 11648.9610266324. The cubic root of 135698293 is about 513.8757553716.
The spelling of 135698293 in words is "one hundred thirty-five million, six hundred ninety-eight thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •