Base | Representation |
---|---|
bin | 10100101100101011… |
… | …01110101101010011 |
3 | 1001200102120220222201 |
4 | 22112111232231103 |
5 | 140224211311311 |
6 | 5034353144031 |
7 | 542241153262 |
oct | 122625565523 |
9 | 31612526881 |
10 | 11112213331 |
11 | 479261138a |
12 | 21a155b017 |
13 | 108125627b |
14 | 775b605d9 |
15 | 4508579c1 |
hex | 29656eb53 |
11112213331 has 4 divisors (see below), whose sum is σ = 11176445952. Its totient is φ = 11047980712.
The previous prime is 11112213311. The next prime is 11112213419. The reversal of 11112213331 is 13331221111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11112213331 - 29 = 11112212819 is a prime.
It is a super-2 number, since 2×111122133312 (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 = 11112213299 and 11112213308.
It is not an unprimeable number, because it can be changed into a prime (11112213311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32116051 + ... + 32116396.
It is an arithmetic number, because the mean of its divisors is an integer number (2794111488).
Almost surely, 211112213331 is an apocalyptic number.
11112213331 is a deficient number, since it is larger than the sum of its proper divisors (64232621).
11112213331 is an equidigital number, since it uses as much as digits as its factorization.
11112213331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64232620.
The product of its digits is 108, while the sum is 19.
Adding to 11112213331 its reverse (13331221111), we get a palindrome (24443434442).
The spelling of 11112213331 in words is "eleven billion, one hundred twelve million, two hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •