Base | Representation |
---|---|
bin | 1001001001000000110111… |
… | …01001111000101010011011 |
3 | 2122011121222001010212122211 |
4 | 10210200123221320222123 |
5 | 10113313131143110412 |
6 | 110430121521055551 |
7 | 4143146211425656 |
oct | 444403351705233 |
9 | 78147861125584 |
10 | 20100910910107 |
11 | 644a8261a7405 |
12 | 23078364875b7 |
13 | b2a67a739a31 |
14 | 4d6c6427889d |
15 | 24cd0e054ca7 |
hex | 12481ba78a9b |
20100910910107 has 2 divisors, whose sum is σ = 20100910910108. Its totient is φ = 20100910910106.
The previous prime is 20100910910071. The next prime is 20100910910131. The reversal of 20100910910107 is 70101901900102.
It is a happy number.
Together with previous prime (20100910910071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20100910910107 - 211 = 20100910908059 is a prime.
It is not a weakly prime, because it can be changed into another prime (20100910910807) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050455455053 + 10050455455054.
It is an arithmetic number, because the mean of its divisors is an integer number (10050455455054).
Almost surely, 220100910910107 is an apocalyptic number.
20100910910107 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100910910107 is an equidigital number, since it uses as much as digits as its factorization.
20100910910107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 31.
The spelling of 20100910910107 in words is "twenty trillion, one hundred billion, nine hundred ten million, nine hundred ten thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •