Base | Representation |
---|---|
bin | 1010000110110100010000… |
… | …0000010010001111001101 |
3 | 1110100022120210212102001211 |
4 | 2201231010000102033031 |
5 | 2424030312124221031 |
6 | 35344514535534421 |
7 | 2224555126520644 |
oct | 241550400221715 |
9 | 43308523772054 |
10 | 11112221320141 |
11 | 35a4737270797 |
12 | 12b575852a411 |
13 | 627b54ba8876 |
14 | 2a5b9778635b |
15 | 1440c37d0bb1 |
hex | a1b440123cd |
11112221320141 has 2 divisors, whose sum is σ = 11112221320142. Its totient is φ = 11112221320140.
The previous prime is 11112221320111. The next prime is 11112221320147. The reversal of 11112221320141 is 14102312221111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10974339064516 + 137882255625 = 3312754^2 + 371325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11112221320141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112221320147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556110660070 + 5556110660071.
It is an arithmetic number, because the mean of its divisors is an integer number (5556110660071).
Almost surely, 211112221320141 is an apocalyptic number.
It is an amenable number.
11112221320141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112221320141 is an equidigital number, since it uses as much as digits as its factorization.
11112221320141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 11112221320141 its reverse (14102312221111), we get a palindrome (25214533541252).
The spelling of 11112221320141 in words is "eleven trillion, one hundred twelve billion, two hundred twenty-one million, three hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •