Base | Representation |
---|---|
bin | 1001010011000000010100… |
… | …1111100010000001111111 |
3 | 1100012020001102121111221022 |
4 | 2110300011033202001333 |
5 | 2314434340142401421 |
6 | 33423550023454355 |
7 | 2103344263260566 |
oct | 224600517420177 |
9 | 40166042544838 |
10 | 10222110122111 |
11 | 3291199746208 |
12 | 1191143bb73bb |
13 | 591c30075494 |
14 | 274a77858bdd |
15 | 12ad794e97ab |
hex | 94c053e207f |
10222110122111 has 8 divisors (see below), whose sum is σ = 10278684452400. Its totient is φ = 10165536875520.
The previous prime is 10222110122083. The next prime is 10222110122117. The reversal of 10222110122111 is 11122101122201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10222110122111 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 10222110122111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222110122117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25307780 + ... + 25708518.
It is an arithmetic number, because the mean of its divisors is an integer number (1284835556550).
Almost surely, 210222110122111 is an apocalyptic number.
10222110122111 is a deficient number, since it is larger than the sum of its proper divisors (56574330289).
10222110122111 is a wasteful number, since it uses less digits than its factorization.
10222110122111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 541849.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10222110122111 its reverse (11122101122201), we get a palindrome (21344211244312).
The spelling of 10222110122111 in words is "ten trillion, two hundred twenty-two billion, one hundred ten million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •