Base | Representation |
---|---|
bin | 1010000011011111100101… |
… | …1011001011011111010101 |
3 | 1110010212020101211111111202 |
4 | 2200313321123023133111 |
5 | 2422111404142114331 |
6 | 35302354212442245 |
7 | 2220464364221045 |
oct | 240677133133725 |
9 | 43125211744452 |
10 | 11055135504341 |
11 | 3582502870425 |
12 | 12a6686619385 |
13 | 622658117636 |
14 | 2a30ddd5b725 |
15 | 142881d1eecb |
hex | a0df96cb7d5 |
11055135504341 has 2 divisors, whose sum is σ = 11055135504342. Its totient is φ = 11055135504340.
The previous prime is 11055135504241. The next prime is 11055135504353. The reversal of 11055135504341 is 14340553155011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10462960622500 + 592174881841 = 3234650^2 + 769529^2 .
It is a cyclic number.
It is not a de Polignac number, because 11055135504341 - 238 = 10780257597397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11055135504295 and 11055135504304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11055135504241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5527567752170 + 5527567752171.
It is an arithmetic number, because the mean of its divisors is an integer number (5527567752171).
Almost surely, 211055135504341 is an apocalyptic number.
It is an amenable number.
11055135504341 is a deficient number, since it is larger than the sum of its proper divisors (1).
11055135504341 is an equidigital number, since it uses as much as digits as its factorization.
11055135504341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90000, while the sum is 38.
Adding to 11055135504341 its reverse (14340553155011), we get a palindrome (25395688659352).
The spelling of 11055135504341 in words is "eleven trillion, fifty-five billion, one hundred thirty-five million, five hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •