Base | Representation |
---|---|
bin | 10010101110000100… |
… | …001011111000011011 |
3 | 1220212211002001120100 |
4 | 102232010023320123 |
5 | 312131122431021 |
6 | 13122305030443 |
7 | 1311046620021 |
oct | 225604137033 |
9 | 56784061510 |
10 | 20100202011 |
11 | 85850492aa |
12 | 3a8b625423 |
13 | 1b8438c376 |
14 | d8972a711 |
15 | 7c9960626 |
hex | 4ae10be1b |
20100202011 has 48 divisors (see below), whose sum is σ = 31618173600. Its totient is φ = 12261072384.
The previous prime is 20100201983. The next prime is 20100202091. The reversal of 20100202011 is 11020200102.
It is a de Polignac number, because none of the positive numbers 2k-20100202011 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 = 20100201984 and 20100202002.
It is not an unprimeable number, because it can be changed into a prime (20100202091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 855205 + ... + 878393.
It is an arithmetic number, because the mean of its divisors is an integer number (658711950).
Almost surely, 220100202011 is an apocalyptic number.
20100202011 is a deficient number, since it is larger than the sum of its proper divisors (11517971589).
20100202011 is a wasteful number, since it uses less digits than its factorization.
20100202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23388 (or 23385 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20100202011 its reverse (11020200102), we get a palindrome (31120402113).
It can be divided in two parts, 20100 and 202011, that added together give a triangular number (222111 = T666).
The spelling of 20100202011 in words is "twenty billion, one hundred million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •