Base | Representation |
---|---|
bin | 100110010101… |
… | …1011111110111 |
3 | 1101211020112121 |
4 | 1030223133313 |
5 | 20121213421 |
6 | 1554500411 |
7 | 332566552 |
oct | 114533767 |
9 | 41736477 |
10 | 20101111 |
11 | 1038a298 |
12 | 6894707 |
13 | 421a464 |
14 | 2953699 |
15 | 1b70d41 |
hex | 132b7f7 |
20101111 has 4 divisors (see below), whose sum is σ = 20591424. Its totient is φ = 19610800.
The previous prime is 20101099. The next prime is 20101129. The reversal of 20101111 is 11110102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20101111 - 25 = 20101079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20101094 and 20101103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 245095 + ... + 245176.
It is an arithmetic number, because the mean of its divisors is an integer number (5147856).
Almost surely, 220101111 is an apocalyptic number.
20101111 is a deficient number, since it is larger than the sum of its proper divisors (490313).
20101111 is an equidigital number, since it uses as much as digits as its factorization.
20101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490312.
The product of its (nonzero) digits is 2, while the sum is 7.
The square root of 20101111 is about 4483.4262567817. The cubic root of 20101111 is about 271.8984220980.
Adding to 20101111 its reverse (11110102), we get a palindrome (31211213).
Multiplying 20101111 by its reverse (11110102), we get a palindrome (223325393523322).
The spelling of 20101111 in words is "twenty million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •