Base | Representation |
---|---|
bin | 100000010110010101110… |
… | …010110101011000111101 |
3 | 21212111222110210210020202 |
4 | 200112111302311120331 |
5 | 242410211333114401 |
6 | 4421123125253245 |
7 | 316415201424044 |
oct | 40262562653075 |
9 | 7774873723222 |
10 | 2223011223101 |
11 | 787856977539 |
12 | 2baa01b64225 |
13 | 131824071b96 |
14 | 79846b4155b |
15 | 3cc5b72c06b |
hex | 20595cb563d |
2223011223101 has 2 divisors, whose sum is σ = 2223011223102. Its totient is φ = 2223011223100.
The previous prime is 2223011223073. The next prime is 2223011223107. The reversal of 2223011223101 is 1013221103222.
2223011223101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2220848043001 + 2163180100 = 1490251^2 + 46510^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2223011223101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2223011223107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111505611550 + 1111505611551.
It is an arithmetic number, because the mean of its divisors is an integer number (1111505611551).
Almost surely, 22223011223101 is an apocalyptic number.
It is an amenable number.
2223011223101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2223011223101 is an equidigital number, since it uses as much as digits as its factorization.
2223011223101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2223011223101 its reverse (1013221103222), we get a palindrome (3236232326323).
The spelling of 2223011223101 in words is "two trillion, two hundred twenty-three billion, eleven million, two hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •