Base | Representation |
---|---|
bin | 1001000110101100000011… |
… | …10010101010110100011001 |
3 | 2121212222202022111201220020 |
4 | 10203112001302222310121 |
5 | 10111011022122010410 |
6 | 110325310224021053 |
7 | 4134320354014500 |
oct | 443260162526431 |
9 | 77788668451806 |
10 | 20021020110105 |
11 | 64199599a5963 |
12 | 22b425b161789 |
13 | b22c8811a101 |
14 | 4d3045c07837 |
15 | 24abd5456a70 |
hex | 123581caad19 |
20021020110105 has 48 divisors (see below), whose sum is σ = 37322668658304. Its totient is φ = 9137961423360.
The previous prime is 20021020110097. The next prime is 20021020110107. The reversal of 20021020110105 is 50101102012002.
It is not a de Polignac number, because 20021020110105 - 23 = 20021020110097 is a prime.
It is a super-2 number, since 2×200210201101052 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (20021020110107) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21120592 + ... + 22048161.
It is an arithmetic number, because the mean of its divisors is an integer number (777555597048).
Almost surely, 220021020110105 is an apocalyptic number.
It is an amenable number.
20021020110105 is a deficient number, since it is larger than the sum of its proper divisors (17301648548199).
20021020110105 is a wasteful number, since it uses less digits than its factorization.
20021020110105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43169406 (or 43169399 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 15.
Adding to 20021020110105 its reverse (50101102012002), we get a palindrome (70122122122107).
The spelling of 20021020110105 in words is "twenty trillion, twenty-one billion, twenty million, one hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •