Base | Representation |
---|---|
bin | 100000010101011010001… |
… | …100011101111111001111 |
3 | 21212102101210021221101100 |
4 | 200111122030131333033 |
5 | 242401134343410111 |
6 | 4420440005514143 |
7 | 316351340334432 |
oct | 40253214357717 |
9 | 7772353257340 |
10 | 2222011310031 |
11 | 787393502aa7 |
12 | 2ba783112953 |
13 | 1316c4b65446 |
14 | 79790017819 |
15 | 3cbeda66756 |
hex | 2055a31dfcf |
2222011310031 has 6 divisors (see below), whose sum is σ = 3209571892280. Its totient is φ = 1481340873348.
The previous prime is 2222011309943. The next prime is 2222011310083. The reversal of 2222011310031 is 1300131102222.
It is not a de Polignac number, because 2222011310031 - 215 = 2222011277263 is a prime.
It is a super-2 number, since 2×22220113100312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2222011309986 and 2222011310013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222011318031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 123445072771 + ... + 123445072788.
Almost surely, 22222011310031 is an apocalyptic number.
2222011310031 is a deficient number, since it is larger than the sum of its proper divisors (987560582249).
2222011310031 is a wasteful number, since it uses less digits than its factorization.
2222011310031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246890145565 (or 246890145562 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2222011310031 its reverse (1300131102222), we get a palindrome (3522142412253).
The spelling of 2222011310031 in words is "two trillion, two hundred twenty-two billion, eleven million, three hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •