Base | Representation |
---|---|
bin | 10010101110101001… |
… | …100100011101011011 |
3 | 1220220111111221122022 |
4 | 102232221210131123 |
5 | 312141130031021 |
6 | 13123255045055 |
7 | 1311226124321 |
oct | 225651443533 |
9 | 56814457568 |
10 | 20110002011 |
11 | 858a632180 |
12 | 3a9297078b |
13 | 1b86410b98 |
14 | d8ab5bd11 |
15 | 7ca7491ab |
hex | 4aea6475b |
20110002011 has 8 divisors (see below), whose sum is σ = 21949117248. Its totient is φ = 18272709000.
The previous prime is 20110001987. The next prime is 20110002013. The reversal of 20110002011 is 11020001102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20110002011 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 20110002011.
It is not an unprimeable number, because it can be changed into a prime (20110002013) 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 7 ways as a sum of consecutive naturals, for example, 432425 + ... + 476666.
It is an arithmetic number, because the mean of its divisors is an integer number (2743639656).
Almost surely, 220110002011 is an apocalyptic number.
20110002011 is a deficient number, since it is larger than the sum of its proper divisors (1839115237).
20110002011 is a wasteful number, since it uses less digits than its factorization.
20110002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 911113.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 20110002011 its reverse (11020001102), we get a palindrome (31130003113).
Subtracting from 20110002011 its reverse (11020001102), we obtain a palindrome (9090000909).
The spelling of 20110002011 in words is "twenty billion, one hundred ten million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •