Base | Representation |
---|---|
bin | 111110111000111001… |
… | …0101111111000111101 |
3 | 110220121002021002012001 |
4 | 1331301302233320331 |
5 | 4203042044134231 |
6 | 142013104542301 |
7 | 12520512351613 |
oct | 1756162577075 |
9 | 426532232161 |
10 | 135053114941 |
11 | 52303a65188 |
12 | 22211021991 |
13 | c973a3c584 |
14 | 67726356b3 |
15 | 37a67acb61 |
hex | 1f71cafe3d |
135053114941 has 2 divisors, whose sum is σ = 135053114942. Its totient is φ = 135053114940.
The previous prime is 135053114893. The next prime is 135053114947. The reversal of 135053114941 is 149411350531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100213399225 + 34839715716 = 316565^2 + 186654^2 .
It is a cyclic number.
It is not a de Polignac number, because 135053114941 - 27 = 135053114813 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135053114941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135053114947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67526557470 + 67526557471.
It is an arithmetic number, because the mean of its divisors is an integer number (67526557471).
Almost surely, 2135053114941 is an apocalyptic number.
It is an amenable number.
135053114941 is a deficient number, since it is larger than the sum of its proper divisors (1).
135053114941 is an equidigital number, since it uses as much as digits as its factorization.
135053114941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 37.
The spelling of 135053114941 in words is "one hundred thirty-five billion, fifty-three million, one hundred fourteen thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •