Base | Representation |
---|---|
bin | 10010101000001110… |
… | …011010011111101011 |
3 | 1220121222201001112101 |
4 | 102220032122133223 |
5 | 311431032020021 |
6 | 13104444554231 |
7 | 1305450031144 |
oct | 225016323753 |
9 | 56558631471 |
10 | 20002220011 |
11 | 8534805a44 |
12 | 3a62852977 |
13 | 1b69ca4257 |
14 | d7a702acb |
15 | 7c1058a91 |
hex | 4a839a7eb |
20002220011 has 4 divisors (see below), whose sum is σ = 20011301752. Its totient is φ = 19993138272.
The previous prime is 20002219969. The next prime is 20002220057. The reversal of 20002220011 is 11002220002.
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 20002220011 - 221 = 20000122859 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20002220011.
It is not an unprimeable number, because it can be changed into a prime (20002220081) 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 in 3 ways as a sum of consecutive naturals, for example, 4537566 + ... + 4541971.
It is an arithmetic number, because the mean of its divisors is an integer number (5002825438).
Almost surely, 220002220011 is an apocalyptic number.
20002220011 is a deficient number, since it is larger than the sum of its proper divisors (9081741).
20002220011 is an equidigital number, since it uses as much as digits as its factorization.
20002220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9081740.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 20002220011 its reverse (11002220002), we get a palindrome (31004440013).
Subtracting from 20002220011 its reverse (11002220002), we obtain a palindrome (9000000009).
The spelling of 20002220011 in words is "twenty billion, two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •