Base | Representation |
---|---|
bin | 10100101101110110… |
… | …01000111100010001 |
3 | 1001201010001011100212 |
4 | 22112323020330101 |
5 | 140234214120423 |
6 | 5035343253505 |
7 | 542420416421 |
oct | 122673107421 |
9 | 31633034325 |
10 | 11122020113 |
11 | 47980aa366 |
12 | 21a48aa295 |
13 | 10832aabb9 |
14 | 777194481 |
15 | 451643578 |
hex | 296ec8f11 |
11122020113 has 2 divisors, whose sum is σ = 11122020114. Its totient is φ = 11122020112.
The previous prime is 11122020089. The next prime is 11122020121. The reversal of 11122020113 is 31102022111.
11122020113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7698834049 + 3423186064 = 87743^2 + 58508^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122020113 - 214 = 11122003729 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11122020713) 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, 5561010056 + 5561010057.
It is an arithmetic number, because the mean of its divisors is an integer number (5561010057).
Almost surely, 211122020113 is an apocalyptic number.
It is an amenable number.
11122020113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122020113 is an equidigital number, since it uses as much as digits as its factorization.
11122020113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11122020113 its reverse (31102022111), we get a palindrome (42224042224).
The spelling of 11122020113 in words is "eleven billion, one hundred twenty-two million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •