Base | Representation |
---|---|
bin | 1001010010111001001110… |
… | …0001000101001110101111 |
3 | 1100012001010110100222020120 |
4 | 2110232103201011032233 |
5 | 2314421433220320421 |
6 | 33423032424420023 |
7 | 2103246064442544 |
oct | 224562341051657 |
9 | 40161113328216 |
10 | 10220202120111 |
11 | 32903aa725055 |
12 | 11908b1017613 |
13 | 5919b799c609 |
14 | 2749362aabcb |
15 | 12acb6c5a8c6 |
hex | 94b938453af |
10220202120111 has 8 divisors (see below), whose sum is σ = 13850328556464. Its totient is φ = 6701771881920.
The previous prime is 10220202120097. The next prime is 10220202120131. The reversal of 10220202120111 is 11102120202201.
10220202120111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10220202120111 - 29 = 10220202119599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220202120131) 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, 27924049326 + ... + 27924049691.
It is an arithmetic number, because the mean of its divisors is an integer number (1731291069558).
Almost surely, 210220202120111 is an apocalyptic number.
10220202120111 is a deficient number, since it is larger than the sum of its proper divisors (3630126436353).
10220202120111 is an equidigital number, since it uses as much as digits as its factorization.
10220202120111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55848099081.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10220202120111 its reverse (11102120202201), we get a palindrome (21322322322312).
The spelling of 10220202120111 in words is "ten trillion, two hundred twenty billion, two hundred two million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •