Base | Representation |
---|---|
bin | 10100100001111011… |
… | …11110101001110111 |
3 | 1001110011000202021002 |
4 | 22100331332221313 |
5 | 140033124213421 |
6 | 5021413513515 |
7 | 540065212400 |
oct | 122075765167 |
9 | 31404022232 |
10 | 11022101111 |
11 | 474676377a |
12 | 217734289b |
13 | 1068695228 |
14 | 767bc49a7 |
15 | 4479a7b0b |
hex | 290f7ea77 |
11022101111 has 6 divisors (see below), whose sum is σ = 12821627880. Its totient is φ = 9447515196.
The previous prime is 11022101059. The next prime is 11022101143. The reversal of 11022101111 is 11110122011.
It is not a de Polignac number, because 11022101111 - 230 = 9948359287 is a prime.
It is a super-2 number, since 2×110221011112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11022101092 and 11022101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022101161) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 112470371 + ... + 112470468.
It is an arithmetic number, because the mean of its divisors is an integer number (2136937980).
Almost surely, 211022101111 is an apocalyptic number.
11022101111 is a deficient number, since it is larger than the sum of its proper divisors (1799526769).
11022101111 is an equidigital number, since it uses as much as digits as its factorization.
11022101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224940853 (or 224940846 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11022101111 its reverse (11110122011), we get a palindrome (22132223122).
The spelling of 11022101111 in words is "eleven billion, twenty-two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •