Base | Representation |
---|---|
bin | 10010101110101001… |
… | …100100001111010111 |
3 | 1220220111111220101222 |
4 | 102232221210033113 |
5 | 312141130013421 |
6 | 13123255040555 |
7 | 1311226121564 |
oct | 225651441727 |
9 | 56814456358 |
10 | 20110001111 |
11 | 858a631532 |
12 | 3a9297015b |
13 | 1b86410655 |
14 | d8ab5b86b |
15 | 7ca748cab |
hex | 4aea643d7 |
20110001111 has 2 divisors, whose sum is σ = 20110001112. Its totient is φ = 20110001110.
The previous prime is 20110001101. The next prime is 20110001159. The reversal of 20110001111 is 11110001102.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20110001111 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110001101) 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, 10055000555 + 10055000556.
It is an arithmetic number, because the mean of its divisors is an integer number (10055000556).
Almost surely, 220110001111 is an apocalyptic number.
20110001111 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110001111 is an equidigital number, since it uses as much as digits as its factorization.
20110001111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 20110001111 its reverse (11110001102), we get a palindrome (31220002213).
Subtracting from 20110001111 its reverse (11110001102), we obtain a palindrome (9000000009).
The spelling of 20110001111 in words is "twenty billion, one hundred ten million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •