Base | Representation |
---|---|
bin | 1001010010010100000010… |
… | …1010010111110101110111 |
3 | 1100011002100221020000222221 |
4 | 2110211000222113311313 |
5 | 2314241013330041434 |
6 | 33414302234303211 |
7 | 2102443551664411 |
oct | 224450052276567 |
9 | 40132327200887 |
10 | 10210222112119 |
11 | 3287149225367 |
12 | 118a986887b07 |
13 | 590a87191a43 |
14 | 27426aa6d9b1 |
15 | 12a8d09eb2b4 |
hex | 94940a97d77 |
10210222112119 has 2 divisors, whose sum is σ = 10210222112120. Its totient is φ = 10210222112118.
The previous prime is 10210222112089. The next prime is 10210222112171. The reversal of 10210222112119 is 91121122201201.
10210222112119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10210222112119 - 225 = 10210188557687 is a prime.
It is a super-2 number, since 2×102102221121192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10210222112093 and 10210222112102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210222112219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105111056059 + 5105111056060.
It is an arithmetic number, because the mean of its divisors is an integer number (5105111056060).
Almost surely, 210210222112119 is an apocalyptic number.
10210222112119 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210222112119 is an equidigital number, since it uses as much as digits as its factorization.
10210222112119 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 10210222112119 in words is "ten trillion, two hundred ten billion, two hundred twenty-two million, one hundred twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •