Base | Representation |
---|---|
bin | 100000010100100011111… |
… | …100000100000110011111 |
3 | 21212100001100110102200122 |
4 | 200110203330010012133 |
5 | 242342303331240111 |
6 | 4420205411345155 |
7 | 316316645223146 |
oct | 40244374040637 |
9 | 7770040412618 |
10 | 2221101040031 |
11 | 786a666a6745 |
12 | 2ba56a2b21bb |
13 | 1315ab3b4343 |
14 | 7970518675d |
15 | 3cb98babcdb |
hex | 20523f0419f |
2221101040031 has 2 divisors, whose sum is σ = 2221101040032. Its totient is φ = 2221101040030.
The previous prime is 2221101040013. The next prime is 2221101040127. The reversal of 2221101040031 is 1300401011222.
Together with previous prime (2221101040013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2221101040031 is a prime.
It is a super-2 number, since 2×22211010400312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2221101039991 and 2221101040009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2221101040831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110550520015 + 1110550520016.
It is an arithmetic number, because the mean of its divisors is an integer number (1110550520016).
Almost surely, 22221101040031 is an apocalyptic number.
2221101040031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2221101040031 is an equidigital number, since it uses as much as digits as its factorization.
2221101040031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 2221101040031 its reverse (1300401011222), we get a palindrome (3521502051253).
The spelling of 2221101040031 in words is "two trillion, two hundred twenty-one billion, one hundred one million, forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •