Base | Representation |
---|---|
bin | 10000001010101… |
… | …00000101001001 |
3 | 100110011201220102 |
4 | 20011110011021 |
5 | 234204020242 |
6 | 21242335145 |
7 | 3234446315 |
oct | 1005240511 |
9 | 313151812 |
10 | 135610697 |
11 | 6a604362 |
12 | 394ba4b5 |
13 | 22131521 |
14 | 14020b45 |
15 | bd8ae32 |
hex | 8154149 |
135610697 has 2 divisors, whose sum is σ = 135610698. Its totient is φ = 135610696.
The previous prime is 135610681. The next prime is 135610703. The reversal of 135610697 is 796016531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105349696 + 30261001 = 10264^2 + 5501^2 .
It is a cyclic number.
It is not a de Polignac number, because 135610697 - 24 = 135610681 is a prime.
It is a super-2 number, since 2×1356106972 = 36780522281651618, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 135610697.
It is not a weakly prime, because it can be changed into another prime (135610627) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67805348 + 67805349.
It is an arithmetic number, because the mean of its divisors is an integer number (67805349).
Almost surely, 2135610697 is an apocalyptic number.
It is an amenable number.
135610697 is a deficient number, since it is larger than the sum of its proper divisors (1).
135610697 is an equidigital number, since it uses as much as digits as its factorization.
135610697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34020, while the sum is 38.
The square root of 135610697 is about 11645.2005993886. The cubic root of 135610697 is about 513.7651591638.
The spelling of 135610697 in words is "one hundred thirty-five million, six hundred ten thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •