Base | Representation |
---|---|
bin | 1001000110101010010111… |
… | …00111111000000011111101 |
3 | 2121212220101222102222000212 |
4 | 10203111023213320003331 |
5 | 10111002141443423401 |
6 | 110325040121202205 |
7 | 4134256010240636 |
oct | 443251347700375 |
9 | 77786358388025 |
10 | 20020111311101 |
11 | 6419532a03800 |
12 | 22b4046930365 |
13 | b22b71a62715 |
14 | 4d2d9b23a88d |
15 | 24ab8078cdbb |
hex | 12354b9f80fd |
20020111311101 has 6 divisors (see below), whose sum is σ = 22005576895806. Its totient is φ = 18200101191800.
The previous prime is 20020111311091. The next prime is 20020111311121. The reversal of 20020111311101 is 10111311102002.
It can be written as a sum of positive squares in only one way, i.e., 14434688088601 + 5585423222500 = 3799301^2 + 2363350^2 .
It is not a de Polignac number, because 20020111311101 - 218 = 20020111048957 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 (20020111311121) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 82727732570 + ... + 82727732811.
It is an arithmetic number, because the mean of its divisors is an integer number (3667596149301).
Almost surely, 220020111311101 is an apocalyptic number.
It is an amenable number.
20020111311101 is a deficient number, since it is larger than the sum of its proper divisors (1985465584705).
20020111311101 is a wasteful number, since it uses less digits than its factorization.
20020111311101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165455465403 (or 165455465392 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 20020111311101 its reverse (10111311102002), we get a palindrome (30131422413103).
The spelling of 20020111311101 in words is "twenty trillion, twenty billion, one hundred eleven million, three hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •