Base | Representation |
---|---|
bin | 10010101000110000… |
… | …010100111001111011 |
3 | 1220122121102201022122 |
4 | 102220300110321323 |
5 | 311440321010021 |
6 | 13105403311455 |
7 | 1305615425414 |
oct | 225060247173 |
9 | 56577381278 |
10 | 20011110011 |
11 | 8539828152 |
12 | 3a6581b58b |
13 | 1b6ba977c9 |
14 | d7b97880b |
15 | 7c1c12bab |
hex | 4a8c14e7b |
20011110011 has 4 divisors (see below), whose sum is σ = 20011436712. Its totient is φ = 20010783312.
The previous prime is 20011109971. The next prime is 20011110019. The reversal of 20011110011 is 11001111002.
It is a happy number.
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 20011110011 - 234 = 2831240827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20011110019) 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, 40850 + ... + 204183.
It is an arithmetic number, because the mean of its divisors is an integer number (5002859178).
Almost surely, 220011110011 is an apocalyptic number.
20011110011 is a deficient number, since it is larger than the sum of its proper divisors (326701).
20011110011 is an equidigital number, since it uses as much as digits as its factorization.
20011110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326700.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 20011110011 its reverse (11001111002), we get a palindrome (31012221013).
Subtracting from 20011110011 its reverse (11001111002), we obtain a palindrome (9009999009).
It can be divided in two parts, 2001111001 and 1, that added together give a palindrome (2001111002).
The spelling of 20011110011 in words is "twenty billion, eleven million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •