Base | Representation |
---|---|
bin | 1010001100101000000010… |
… | …0010101010001101101011 |
3 | 1110200212012000222012120022 |
4 | 2203022000202222031223 |
5 | 2432144204412241021 |
6 | 35502421553551055 |
7 | 2235020223561554 |
oct | 243120042521553 |
9 | 43625160865508 |
10 | 11212021212011 |
11 | 3632a9a74a674 |
12 | 1310b6b27548b |
13 | 63439b0c3a19 |
14 | 2aa943dd732b |
15 | 1469b518e1ab |
hex | a32808aa36b |
11212021212011 has 4 divisors (see below), whose sum is σ = 11212030696800. Its totient is φ = 11212011727224.
The previous prime is 11212021211999. The next prime is 11212021212019. The reversal of 11212021212011 is 11021212021211.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 11212021212011 - 26 = 11212021211947 is a prime.
It is a super-2 number, since 2×112120212120112 (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 (11212021212019) 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, 2666276 + ... + 5434433.
It is an arithmetic number, because the mean of its divisors is an integer number (2803007674200).
Almost surely, 211212021212011 is an apocalyptic number.
11212021212011 is a deficient number, since it is larger than the sum of its proper divisors (9484789).
11212021212011 is an equidigital number, since it uses as much as digits as its factorization.
11212021212011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9484788.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11212021212011 its reverse (11021212021211), we get a palindrome (22233233233222).
The spelling of 11212021212011 in words is "eleven trillion, two hundred twelve billion, twenty-one million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •