Base | Representation |
---|---|
bin | 11110110101101011100100… |
… | …110110000101001100011101 |
3 | 122210020010112222010010120201 |
4 | 132311223210312011030131 |
5 | 120234131342030433024 |
6 | 1200243412435543501 |
7 | 40365652453506223 |
oct | 3665534466051435 |
9 | 583203488103521 |
10 | 135630316655389 |
11 | 3a241548971186 |
12 | 1326609275ab91 |
13 | 5a8ab6514b79a |
14 | 256c784300b13 |
15 | 10a30c8460744 |
hex | 7b5ae4d8531d |
135630316655389 has 2 divisors, whose sum is σ = 135630316655390. Its totient is φ = 135630316655388.
The previous prime is 135630316655347. The next prime is 135630316655399. The reversal of 135630316655389 is 983556613036531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82543675476025 + 53086641179364 = 9085355^2 + 7286058^2 .
It is a cyclic number.
It is not a de Polignac number, because 135630316655389 - 215 = 135630316622621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135630316655389.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135630316655399) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67815158327694 + 67815158327695.
It is an arithmetic number, because the mean of its divisors is an integer number (67815158327695).
Almost surely, 2135630316655389 is an apocalyptic number.
It is an amenable number.
135630316655389 is a deficient number, since it is larger than the sum of its proper divisors (1).
135630316655389 is an equidigital number, since it uses as much as digits as its factorization.
135630316655389 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 157464000, while the sum is 64.
The spelling of 135630316655389 in words is "one hundred thirty-five trillion, six hundred thirty billion, three hundred sixteen million, six hundred fifty-five thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •