Base | Representation |
---|---|
bin | 100000010100100110011… |
… | …101110100101010000101 |
3 | 21212100011022020210010202 |
4 | 200110212131310222011 |
5 | 242342400210202401 |
6 | 4420213524300245 |
7 | 316321001523161 |
oct | 40244635645205 |
9 | 7770138223122 |
10 | 2221143444101 |
11 | 786a8862952a |
12 | 2ba580541685 |
13 | 1315b71101ca |
14 | 7970aa63ca1 |
15 | 3cb9c78606b |
hex | 20526774a85 |
2221143444101 has 2 divisors, whose sum is σ = 2221143444102. Its totient is φ = 2221143444100.
The previous prime is 2221143444077. The next prime is 2221143444161. The reversal of 2221143444101 is 1014443411222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1773227803876 + 447915640225 = 1331626^2 + 669265^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2221143444101 is a prime.
It is a super-2 number, since 2×22211434441012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2221143444161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110571722050 + 1110571722051.
It is an arithmetic number, because the mean of its divisors is an integer number (1110571722051).
Almost surely, 22221143444101 is an apocalyptic number.
It is an amenable number.
2221143444101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2221143444101 is an equidigital number, since it uses as much as digits as its factorization.
2221143444101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 2221143444101 its reverse (1014443411222), we get a palindrome (3235586855323).
The spelling of 2221143444101 in words is "two trillion, two hundred twenty-one billion, one hundred forty-three million, four hundred forty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •