Base | Representation |
---|---|
bin | 1001000110101100000001… |
… | …00101111101100111011011 |
3 | 2121212222200220200010210000 |
4 | 10203112000211331213123 |
5 | 10111011002000031021 |
6 | 110325304225024043 |
7 | 4134320021055351 |
oct | 443260045754733 |
9 | 77788626603700 |
10 | 20021000002011 |
11 | 64199496113a8 |
12 | 22b4254485023 |
13 | b22c83bc9728 |
14 | 4d30432917d1 |
15 | 24abd37d3b26 |
hex | 12358097d9db |
20021000002011 has 40 divisors (see below), whose sum is σ = 31209218118144. Its totient is φ = 12766621578480.
The previous prime is 20021000001967. The next prime is 20021000002013. The reversal of 20021000002011 is 11020000012002.
It is not a de Polignac number, because 20021000002011 - 211 = 20020999999963 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20021000001984 and 20021000002002.
It is not an unprimeable number, because it can be changed into a prime (20021000002013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 67902696 + ... + 68196906.
Almost surely, 220021000002011 is an apocalyptic number.
20021000002011 is a deficient number, since it is larger than the sum of its proper divisors (11188218116133).
20021000002011 is a wasteful number, since it uses less digits than its factorization.
20021000002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330773 (or 330764 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20021000002011 its reverse (11020000012002), we get a palindrome (31041000014013).
Subtracting from 20021000002011 its reverse (11020000012002), we obtain a palindrome (9000999990009).
The spelling of 20021000002011 in words is "twenty trillion, twenty-one billion, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •