Base | Representation |
---|---|
bin | 10010101000101100… |
… | …110110101111001011 |
3 | 1220122112201111000221 |
4 | 102220230312233023 |
5 | 311440102400021 |
6 | 13105332010511 |
7 | 1305604615354 |
oct | 225054665713 |
9 | 56575644027 |
10 | 20010200011 |
11 | 853926648a |
12 | 3a65460a37 |
13 | 1b6b839549 |
14 | d7b7bcd2b |
15 | 7c1ad3241 |
hex | 4a8b36bcb |
20010200011 has 8 divisors (see below), whose sum is σ = 20042591184. Its totient is φ = 19977834240.
The previous prime is 20010199973. The next prime is 20010200059. The reversal of 20010200011 is 11000201002.
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-20010200011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20010199967 and 20010200003.
It is not an unprimeable number, because it can be changed into a prime (20010200311) 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, 2096931 + ... + 2106451.
It is an arithmetic number, because the mean of its divisors is an integer number (2505323898).
Almost surely, 220010200011 is an apocalyptic number.
20010200011 is a deficient number, since it is larger than the sum of its proper divisors (32391173).
20010200011 is an equidigital number, since it uses as much as digits as its factorization.
20010200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12701.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 20010200011 its reverse (11000201002), we get a palindrome (31010401013).
Subtracting from 20010200011 its reverse (11000201002), we obtain a palindrome (9009999009).
The spelling of 20010200011 in words is "twenty billion, ten million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •