Base | Representation |
---|---|
bin | 10010110100100111… |
… | …000110111010101011 |
3 | 1221011110201101112200 |
4 | 102310213012322223 |
5 | 312342231120021 |
6 | 13141230511243 |
7 | 1313552223066 |
oct | 226447067253 |
9 | 57143641480 |
10 | 20210020011 |
11 | 8631036185 |
12 | 3b00365523 |
13 | 1ba105c92c |
14 | d9a1558dd |
15 | 7d4404126 |
hex | 4b49c6eab |
20210020011 has 12 divisors (see below), whose sum is σ = 29543966088. Its totient is φ = 13311016704.
The previous prime is 20210020003. The next prime is 20210020021. The reversal of 20210020011 is 11002001202.
It is not a de Polignac number, because 20210020011 - 23 = 20210020003 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 = 20210019975 and 20210020002.
It is not an unprimeable number, because it can be changed into a prime (20210020021) 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 11 ways as a sum of consecutive naturals, for example, 13526710 + ... + 13528203.
It is an arithmetic number, because the mean of its divisors is an integer number (2461997174).
Almost surely, 220210020011 is an apocalyptic number.
20210020011 is a deficient number, since it is larger than the sum of its proper divisors (9333946077).
20210020011 is a wasteful number, since it uses less digits than its factorization.
20210020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27055002 (or 27054999 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20210020011 its reverse (11002001202), we get a palindrome (31212021213).
It can be divided in two parts, 202100 and 20011, that added together give a triangular number (222111 = T666).
The spelling of 20210020011 in words is "twenty billion, two hundred ten million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •