Base | Representation |
---|---|
bin | 111110110111110110… |
… | …0000011100001110101 |
3 | 110220111121211012100022 |
4 | 1331233230003201311 |
5 | 4203004024242231 |
6 | 142005404054525 |
7 | 12516603262124 |
oct | 1755754034165 |
9 | 426447735308 |
10 | 135017805941 |
11 | 52296038a97 |
12 | 22201234445 |
13 | c969628c85 |
14 | 676ba83abb |
15 | 37a3635c7b |
hex | 1f6fb03875 |
135017805941 has 2 divisors, whose sum is σ = 135017805942. Its totient is φ = 135017805940.
The previous prime is 135017805847. The next prime is 135017805961. The reversal of 135017805941 is 149508710531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122573511025 + 12444294916 = 350105^2 + 111554^2 .
It is an emirp because it is prime and its reverse (149508710531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135017805941 - 210 = 135017804917 is a prime.
It is a super-2 number, since 2×1350178059412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 135017805892 and 135017805901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135017805961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67508902970 + 67508902971.
It is an arithmetic number, because the mean of its divisors is an integer number (67508902971).
Almost surely, 2135017805941 is an apocalyptic number.
It is an amenable number.
135017805941 is a deficient number, since it is larger than the sum of its proper divisors (1).
135017805941 is an equidigital number, since it uses as much as digits as its factorization.
135017805941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 151200, while the sum is 44.
The spelling of 135017805941 in words is "one hundred thirty-five billion, seventeen million, eight hundred five thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •