Base | Representation |
---|---|
bin | 10100100001111100… |
… | …00001010101110001 |
3 | 1001110011001022100120 |
4 | 22100332001111301 |
5 | 140033130041423 |
6 | 5021414040453 |
7 | 540065256435 |
oct | 122076012561 |
9 | 31404038316 |
10 | 11022112113 |
11 | 4746770a71 |
12 | 2177349129 |
13 | 106869a23c |
14 | 767bc89c5 |
15 | 4479aaee3 |
hex | 290f81571 |
11022112113 has 4 divisors (see below), whose sum is σ = 14696149488. Its totient is φ = 7348074740.
The previous prime is 11022112069. The next prime is 11022112117. The reversal of 11022112113 is 31121122011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11022112113 - 29 = 11022111601 is a prime.
It is a super-3 number, since 3×110221121133 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11022112092 and 11022112101.
It is not an unprimeable number, because it can be changed into a prime (11022112117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1837018683 + ... + 1837018688.
It is an arithmetic number, because the mean of its divisors is an integer number (3674037372).
Almost surely, 211022112113 is an apocalyptic number.
It is an amenable number.
11022112113 is a deficient number, since it is larger than the sum of its proper divisors (3674037375).
11022112113 is an equidigital number, since it uses as much as digits as its factorization.
11022112113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3674037374.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11022112113 its reverse (31121122011), we get a palindrome (42143234124).
The spelling of 11022112113 in words is "eleven billion, twenty-two million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •