Base | Representation |
---|---|
bin | 1010001101001101100101… |
… | …0010111111000100111101 |
3 | 1110201211012110101100112102 |
4 | 2203103121102333010331 |
5 | 2432330330123204411 |
6 | 35511210041514445 |
7 | 2235525050624363 |
oct | 243233122770475 |
9 | 43654173340472 |
10 | 11222100209981 |
11 | 36372a2010a61 |
12 | 1312b027a2a25 |
13 | 63531628044b |
14 | 2ab21c841633 |
15 | 146da4e53d3b |
hex | a34d94bf13d |
11222100209981 has 2 divisors, whose sum is σ = 11222100209982. Its totient is φ = 11222100209980.
The previous prime is 11222100209941. The next prime is 11222100210007. The reversal of 11222100209981 is 18990200122211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5771117359225 + 5450982850756 = 2402315^2 + 2334734^2 .
It is an emirp because it is prime and its reverse (18990200122211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11222100209981 - 226 = 11222033101117 is a prime.
It is a super-2 number, since 2×112221002099812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11222100209911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5611050104990 + 5611050104991.
It is an arithmetic number, because the mean of its divisors is an integer number (5611050104991).
Almost surely, 211222100209981 is an apocalyptic number.
It is an amenable number.
11222100209981 is a deficient number, since it is larger than the sum of its proper divisors (1).
11222100209981 is an equidigital number, since it uses as much as digits as its factorization.
11222100209981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 38.
The spelling of 11222100209981 in words is "eleven trillion, two hundred twenty-two billion, one hundred million, two hundred nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •