Base | Representation |
---|---|
bin | 1010000001011110010110… |
… | …1101111111110101100101 |
3 | 1110000112200202211010221211 |
4 | 2200113211231333311211 |
5 | 2421024332424422121 |
6 | 35234420030111421 |
7 | 2215125622136245 |
oct | 240274555776545 |
9 | 43015622733854 |
10 | 11020445154661 |
11 | 3569820a95248 |
12 | 129ba0494b571 |
13 | 61c2ba0c00c7 |
14 | 2a156ca17b25 |
15 | 141a01557ce1 |
hex | a05e5b7fd65 |
11020445154661 has 2 divisors, whose sum is σ = 11020445154662. Its totient is φ = 11020445154660.
The previous prime is 11020445154617. The next prime is 11020445154689. The reversal of 11020445154661 is 16645154402011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9031798037025 + 1988647117636 = 3005295^2 + 1410194^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020445154661 - 27 = 11020445154533 is a prime.
It is a super-2 number, since 2×110204451546612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11920445154661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510222577330 + 5510222577331.
It is an arithmetic number, because the mean of its divisors is an integer number (5510222577331).
Almost surely, 211020445154661 is an apocalyptic number.
It is an amenable number.
11020445154661 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020445154661 is an equidigital number, since it uses as much as digits as its factorization.
11020445154661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 115200, while the sum is 40.
Adding to 11020445154661 its reverse (16645154402011), we get a palindrome (27665599556672).
The spelling of 11020445154661 in words is "eleven trillion, twenty billion, four hundred forty-five million, one hundred fifty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •