Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …00011110110000100011101 |
3 | 2121212222221220001011021100 |
4 | 10203112012203312010131 |
5 | 10111011203112010414 |
6 | 110325322202423313 |
7 | 4134322345010610 |
oct | 443260643660435 |
9 | 77788856034240 |
10 | 20021100110109 |
11 | 64199a007706a |
12 | 22b4281b01b39 |
13 | b22c9b87a4a7 |
14 | 4d30526b0177 |
15 | 24abdc4aa609 |
hex | 1235868f611d |
20021100110109 has 24 divisors (see below), whose sum is σ = 34487692117632. Its totient is φ = 10943209997280.
The previous prime is 20021100110107. The next prime is 20021100110149. The reversal of 20021100110109 is 90101100112002.
It is a happy number.
It is not a de Polignac number, because 20021100110109 - 21 = 20021100110107 is a prime.
It is a super-2 number, since 2×200211001101092 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20021100110091 and 20021100110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021100110107) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6908590722 + ... + 6908593619.
It is an arithmetic number, because the mean of its divisors is an integer number (1436987171568).
Almost surely, 220021100110109 is an apocalyptic number.
It is an amenable number.
20021100110109 is a deficient number, since it is larger than the sum of its proper divisors (14466592007523).
20021100110109 is a wasteful number, since it uses less digits than its factorization.
20021100110109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13817184377 (or 13817184374 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
The spelling of 20021100110109 in words is "twenty trillion, twenty-one billion, one hundred million, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •