Base | Representation |
---|---|
bin | 1001010011000000010011… |
… | …0000101000011001001111 |
3 | 1100012020000212100222021111 |
4 | 2110300010300220121033 |
5 | 2314434331104143321 |
6 | 33423545134112451 |
7 | 2103344134362346 |
oct | 224600460503117 |
9 | 40166025328244 |
10 | 10222102021711 |
11 | 3291195113268 |
12 | 119114134b727 |
13 | 591c2b49a448 |
14 | 274a7674ab5d |
15 | 12ad789495e1 |
hex | 94c04c2864f |
10222102021711 has 2 divisors, whose sum is σ = 10222102021712. Its totient is φ = 10222102021710.
The previous prime is 10222102021709. The next prime is 10222102021721. The reversal of 10222102021711 is 11712020122201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10222102021711 - 21 = 10222102021709 is a prime.
It is a super-2 number, since 2×102221020217112 (a number of 27 digits) contains 22 as substring.
Together with 10222102021709, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222102021721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111051010855 + 5111051010856.
It is an arithmetic number, because the mean of its divisors is an integer number (5111051010856).
Almost surely, 210222102021711 is an apocalyptic number.
10222102021711 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222102021711 is an equidigital number, since it uses as much as digits as its factorization.
10222102021711 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 10222102021711 its reverse (11712020122201), we get a palindrome (21934122143912).
The spelling of 10222102021711 in words is "ten trillion, two hundred twenty-two billion, one hundred two million, twenty-one thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •