Base | Representation |
---|---|
bin | 1001010010111111111111… |
… | …1111110000110001011111 |
3 | 1100012012211021222122012022 |
4 | 2110233333333300301133 |
5 | 2314434200124231421 |
6 | 33423533201130355 |
7 | 2103342144152531 |
oct | 224577777606137 |
9 | 40165737878168 |
10 | 10222022102111 |
11 | 3291153a97506 |
12 | 119111a6299bb |
13 | 591c17a67841 |
14 | 274a69ca5851 |
15 | 12ad7190e7ab |
hex | 94bffff0c5f |
10222022102111 has 4 divisors (see below), whose sum is σ = 10760023265400. Its totient is φ = 9684020938824.
The previous prime is 10222022102077. The next prime is 10222022102153. The reversal of 10222022102111 is 11120122022201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10222022102111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10222022102111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222022102161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 269000581616 + ... + 269000581653.
It is an arithmetic number, because the mean of its divisors is an integer number (2690005816350).
Almost surely, 210222022102111 is an apocalyptic number.
10222022102111 is a deficient number, since it is larger than the sum of its proper divisors (538001163289).
10222022102111 is an equidigital number, since it uses as much as digits as its factorization.
10222022102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 538001163288.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10222022102111 its reverse (11120122022201), we get a palindrome (21342144124312).
The spelling of 10222022102111 in words is "ten trillion, two hundred twenty-two billion, twenty-two million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •