Base | Representation |
---|---|
bin | 1001001001000001010001… |
… | …10001111011000100001111 |
3 | 2122011122112101111202002112 |
4 | 10210200220301323010033 |
5 | 10113314104031332121 |
6 | 110430155425014235 |
7 | 4143154524250661 |
oct | 444405061730417 |
9 | 78148471452075 |
10 | 20101131120911 |
11 | 644a929534005 |
12 | 230789818437b |
13 | b2a6b424c399 |
14 | 4d6c855dc531 |
15 | 24cd2355275b |
hex | 124828c7b10f |
20101131120911 has 2 divisors, whose sum is σ = 20101131120912. Its totient is φ = 20101131120910.
The previous prime is 20101131120901. The next prime is 20101131120971. The reversal of 20101131120911 is 11902113110102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20101131120911 - 226 = 20101064012047 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101131120901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050565560455 + 10050565560456.
It is an arithmetic number, because the mean of its divisors is an integer number (10050565560456).
Almost surely, 220101131120911 is an apocalyptic number.
20101131120911 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101131120911 is an equidigital number, since it uses as much as digits as its factorization.
20101131120911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 23.
The spelling of 20101131120911 in words is "twenty trillion, one hundred one billion, one hundred thirty-one million, one hundred twenty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •