Base | Representation |
---|---|
bin | 10010101000000110… |
… | …101111110100100011 |
3 | 1220121211220221121100 |
4 | 102220012233310203 |
5 | 311430023211321 |
6 | 13104333525443 |
7 | 1305423660522 |
oct | 225006576443 |
9 | 56554827540 |
10 | 20000210211 |
11 | 8533662a53 |
12 | 3a62043883 |
13 | 1b6974c517 |
14 | d7a33c4b9 |
15 | 7c0cad326 |
hex | 4a81afd23 |
20000210211 has 24 divisors (see below), whose sum is σ = 30161304576. Its totient is φ = 12746962800.
The previous prime is 20000210159. The next prime is 20000210227. The reversal of 20000210211 is 11201200002.
It is not a de Polignac number, because 20000210211 - 26 = 20000210147 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 = 20000210193 and 20000210202.
It is not an unprimeable number, because it can be changed into a prime (20000210011) 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 23 ways as a sum of consecutive naturals, for example, 379096 + ... + 428618.
It is an arithmetic number, because the mean of its divisors is an integer number (1256721024).
Almost surely, 220000210211 is an apocalyptic number.
20000210211 is a deficient number, since it is larger than the sum of its proper divisors (10161094365).
20000210211 is a wasteful number, since it uses less digits than its factorization.
20000210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51503 (or 51500 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20000210211 its reverse (11201200002), we get a palindrome (31201410213).
The spelling of 20000210211 in words is "twenty billion, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •