Base | Representation |
---|---|
bin | 1010001100101000101111… |
… | …0111000100010001101101 |
3 | 1110200212200021022002000222 |
4 | 2203022023313010101231 |
5 | 2432200102021023041 |
6 | 35502452500101125 |
7 | 2235025020646154 |
oct | 243121367042155 |
9 | 43625607262028 |
10 | 11212211111021 |
11 | 36330879635a8 |
12 | 13110029947a5 |
13 | 6343cb5524bb |
14 | 2aa96130a59b |
15 | 1469c6ba074b |
hex | a328bdc446d |
11212211111021 has 4 divisors (see below), whose sum is σ = 11212254500352. Its totient is φ = 11212167721692.
The previous prime is 11212211111009. The next prime is 11212211111041. The reversal of 11212211111021 is 12011111221211.
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 a de Polignac number, because none of the positive numbers 2k-11212211111021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212211111041) 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, 21304715 + ... + 21824648.
It is an arithmetic number, because the mean of its divisors is an integer number (2803063625088).
Almost surely, 211212211111021 is an apocalyptic number.
It is an amenable number.
11212211111021 is a deficient number, since it is larger than the sum of its proper divisors (43389331).
11212211111021 is an equidigital number, since it uses as much as digits as its factorization.
11212211111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43389330.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11212211111021 its reverse (12011111221211), we get a palindrome (23223322332232).
The spelling of 11212211111021 in words is "eleven trillion, two hundred twelve billion, two hundred eleven million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •