Base | Representation |
---|---|
bin | 1010000011100001001001… |
… | …11011100000111101101111 |
3 | 2220021210122100200012210001 |
4 | 11001300210323200331233 |
5 | 10344232023433033403 |
6 | 115005412042125131 |
7 | 4441321643230042 |
oct | 501604473407557 |
9 | 86253570605701 |
10 | 22111111221103 |
11 | 70552a6937883 |
12 | 25913464b07a7 |
13 | c450b8324288 |
14 | 56627d710c59 |
15 | 2852627abc1d |
hex | 141c24ee0f6f |
22111111221103 has 4 divisors (see below), whose sum is σ = 22119819814120. Its totient is φ = 22102402628088.
The previous prime is 22111111221061. The next prime is 22111111221137. The reversal of 22111111221103 is 30112211111122.
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 22111111221103 - 241 = 19912087965551 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22111111231103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4354292700 + ... + 4354297777.
It is an arithmetic number, because the mean of its divisors is an integer number (5529954953530).
Almost surely, 222111111221103 is an apocalyptic number.
22111111221103 is a deficient number, since it is larger than the sum of its proper divisors (8708593017).
22111111221103 is an equidigital number, since it uses as much as digits as its factorization.
22111111221103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8708593016.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 22111111221103 its reverse (30112211111122), we get a palindrome (52223322332225).
The spelling of 22111111221103 in words is "twenty-two trillion, one hundred eleven billion, one hundred eleven million, two hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •