Base | Representation |
---|---|
bin | 1001000110000101010010… |
… | …11110010000011000011101 |
3 | 2121211000001002111222110201 |
4 | 10203002221132100120131 |
5 | 10110140413004323401 |
6 | 110311545312503501 |
7 | 4132652605416406 |
oct | 443025136203035 |
9 | 77730032458421 |
10 | 20000211011101 |
11 | 6411050790882 |
12 | 22b021224ab91 |
13 | b2101cc24b89 |
14 | 4d20302a89ad |
15 | 24a3b8667b01 |
hex | 1230a979061d |
20000211011101 has 16 divisors (see below), whose sum is σ = 22636381315968. Its totient is φ = 17566151257600.
The previous prime is 20000211011069. The next prime is 20000211011191. The reversal of 20000211011101 is 10111011200002.
It is not a de Polignac number, because 20000211011101 - 25 = 20000211011069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000211011191) 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 15 ways as a sum of consecutive naturals, for example, 623781955 + ... + 623814016.
It is an arithmetic number, because the mean of its divisors is an integer number (1414773832248).
Almost surely, 220000211011101 is an apocalyptic number.
It is an amenable number.
20000211011101 is a deficient number, since it is larger than the sum of its proper divisors (2636170304867).
20000211011101 is a wasteful number, since it uses less digits than its factorization.
20000211011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1247596052.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 20000211011101 its reverse (10111011200002), we get a palindrome (30111222211103).
The spelling of 20000211011101 in words is "twenty trillion, two hundred eleven million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •