Base | Representation |
---|---|
bin | 1010001101001001111011… |
… | …1100011001111100110011 |
3 | 1110201201200020020010001202 |
4 | 2203102132330121330303 |
5 | 2432321324012242321 |
6 | 35510524550321415 |
7 | 2235461562365441 |
oct | 243223674317463 |
9 | 43651606203052 |
10 | 11221121212211 |
11 | 363693a432499 |
12 | 131288a95926b |
13 | 6351bb4b7921 |
14 | 2ab1687ddb91 |
15 | 146d4902070b |
hex | a349ef19f33 |
11221121212211 has 4 divisors (see below), whose sum is σ = 11221205346912. Its totient is φ = 11221037077512.
The previous prime is 11221121212117. The next prime is 11221121212229. The reversal of 11221121212211 is 11221212112211.
It is a happy number.
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 11221121212211 - 234 = 11203941343027 is a prime.
It is a super-2 number, since 2×112211212122112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11221121212261) 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, 41866976 + ... + 42134141.
It is an arithmetic number, because the mean of its divisors is an integer number (2805301336728).
Almost surely, 211221121212211 is an apocalyptic number.
11221121212211 is a deficient number, since it is larger than the sum of its proper divisors (84134701).
11221121212211 is an equidigital number, since it uses as much as digits as its factorization.
11221121212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84134700.
The product of its digits is 64, while the sum is 20.
Adding to 11221121212211 its reverse (11221212112211), we get a palindrome (22442333324422).
The spelling of 11221121212211 in words is "eleven trillion, two hundred twenty-one billion, one hundred twenty-one million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •