Base | Representation |
---|---|
bin | 1010001100101000101101… |
… | …0100010100001100111011 |
3 | 1110200212122122011020201121 |
4 | 2203022023110110030323 |
5 | 2432200042203014321 |
6 | 35502451532530111 |
7 | 2235024550345021 |
oct | 243121324241473 |
9 | 43625578136647 |
10 | 11212202001211 |
11 | 3633082801232 |
12 | 1310bbb920937 |
13 | 6343c96b2b93 |
14 | 2aa960018711 |
15 | 1469c5ea1441 |
hex | a328b51433b |
11212202001211 has 4 divisors (see below), whose sum is σ = 11218598010952. Its totient is φ = 11205805991472.
The previous prime is 11212202001193. The next prime is 11212202001229. The reversal of 11212202001211 is 11210020221211.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (11212202001193) and next prime (11212202001229).
It is a cyclic number.
It is not a de Polignac number, because 11212202001211 - 27 = 11212202001083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11212202001271) 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, 3198002241 + ... + 3198005746.
It is an arithmetic number, because the mean of its divisors is an integer number (2804649502738).
Almost surely, 211212202001211 is an apocalyptic number.
11212202001211 is a deficient number, since it is larger than the sum of its proper divisors (6396009741).
11212202001211 is an equidigital number, since it uses as much as digits as its factorization.
11212202001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6396009740.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11212202001211 its reverse (11210020221211), we get a palindrome (22422222222422).
The spelling of 11212202001211 in words is "eleven trillion, two hundred twelve billion, two hundred two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •