Base | Representation |
---|---|
bin | 1010000110110000001001… |
… | …0111000111111101001001 |
3 | 1110100012202001120010001101 |
4 | 2201230002113013331021 |
5 | 2424021033210323311 |
6 | 35344213355021401 |
7 | 2224515624533236 |
oct | 241540227077511 |
9 | 43305661503041 |
10 | 11111120011081 |
11 | 35a4221641a12 |
12 | 12b54ab73a861 |
13 | 627a0a98a0bc |
14 | 2a5ad13c678d |
15 | 14405bc8bec1 |
hex | a1b025c7f49 |
11111120011081 has 2 divisors, whose sum is σ = 11111120011082. Its totient is φ = 11111120011080.
The previous prime is 11111120011037. The next prime is 11111120011097. The reversal of 11111120011081 is 18011002111111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9331137105481 + 1779982905600 = 3054691^2 + 1334160^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111120011081 - 213 = 11111120002889 is a prime.
It is a super-3 number, since 3×111111200110813 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (11111120011021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555560005540 + 5555560005541.
It is an arithmetic number, because the mean of its divisors is an integer number (5555560005541).
Almost surely, 211111120011081 is an apocalyptic number.
It is an amenable number.
11111120011081 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111120011081 is an equidigital number, since it uses as much as digits as its factorization.
11111120011081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 19.
Adding to 11111120011081 its reverse (18011002111111), we get a palindrome (29122122122192).
The spelling of 11111120011081 in words is "eleven trillion, one hundred eleven billion, one hundred twenty million, eleven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •