Base | Representation |
---|---|
bin | 1011000110010000011010… |
… | …0011101010111101000011 |
3 | 1121012111210011122200211200 |
4 | 2301210012203222331003 |
5 | 3044404411144232321 |
6 | 41541323425512243 |
7 | 2366400466356633 |
oct | 261440643527503 |
9 | 47174704580750 |
10 | 12202112102211 |
11 | 398498319a719 |
12 | 1450a267a2683 |
13 | 6a6867476285 |
14 | 30282a3ba6c3 |
15 | 1626119ecd26 |
hex | b19068eaf43 |
12202112102211 has 12 divisors (see below), whose sum is σ = 17799780691680. Its totient is φ = 8054199406800.
The previous prime is 12202112102203. The next prime is 12202112102239. The reversal of 12202112102211 is 11220121120221.
12202112102211 is a `hidden beast` number, since 1 + 2 + 20 + 211 + 210 + 221 + 1 = 666.
It is not a de Polignac number, because 12202112102211 - 23 = 12202112102203 is a prime.
It is a super-2 number, since 2×122021121022112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12202112102281) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6711831931 + ... + 6711833748.
It is an arithmetic number, because the mean of its divisors is an integer number (1483315057640).
Almost surely, 212202112102211 is an apocalyptic number.
12202112102211 is a deficient number, since it is larger than the sum of its proper divisors (5597668589469).
12202112102211 is a wasteful number, since it uses less digits than its factorization.
12202112102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13423665786 (or 13423665783 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12202112102211 its reverse (11220121120221), we get a palindrome (23422233222432).
The spelling of 12202112102211 in words is "twelve trillion, two hundred two billion, one hundred twelve million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •