Base | Representation |
---|---|
bin | 1010001100000011011100… |
… | …1010001010111101111011 |
3 | 1110122220211120212002201121 |
4 | 2203000313022022331323 |
5 | 2432014101212334321 |
6 | 35454115241530111 |
7 | 2234221650643021 |
oct | 243006712127573 |
9 | 43586746762647 |
10 | 11202200121211 |
11 | 362990aa22800 |
12 | 130b08a1a3937 |
13 | 6334944b7aa8 |
14 | 2aa291926711 |
15 | 1465dcd71441 |
hex | a303728af7b |
11202200121211 has 12 divisors (see below), whose sum is σ = 12422128168296. Its totient is φ = 10093695993920.
The previous prime is 11202200121199. The next prime is 11202200121251. The reversal of 11202200121211 is 11212100220211.
It is not a de Polignac number, because 11202200121211 - 213 = 11202200113019 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11202200121251) 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 11 ways as a sum of consecutive naturals, for example, 409633081 + ... + 409660426.
It is an arithmetic number, because the mean of its divisors is an integer number (1035177347358).
Almost surely, 211202200121211 is an apocalyptic number.
11202200121211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11202200121211 is a deficient number, since it is larger than the sum of its proper divisors (1219928047085).
11202200121211 is a wasteful number, since it uses less digits than its factorization.
11202200121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 819293642 (or 819293631 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11202200121211 its reverse (11212100220211), we get a palindrome (22414300341422).
The spelling of 11202200121211 in words is "eleven trillion, two hundred two billion, two hundred million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •