Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1000100011100110101 |
3 | 101111222111002002200100 |
4 | 1212131231010130311 |
5 | 3300310111120041 |
6 | 122313102504313 |
7 | 10643253511602 |
oct | 1463555043465 |
9 | 344874062610 |
10 | 110020020021 |
11 | 4272848448a |
12 | 193a5595099 |
13 | a4b46b9482 |
14 | 5479b156a9 |
15 | 2cddc4e6b6 |
hex | 199db44735 |
110020020021 has 12 divisors (see below), whose sum is σ = 159221671648. Its totient is φ = 73206434664.
The previous prime is 110020020007. The next prime is 110020020083. The reversal of 110020020021 is 120020020011.
It is not a de Polignac number, because 110020020021 - 29 = 110020019509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110020019985 and 110020020012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110020020091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11682145 + ... + 11691558.
Almost surely, 2110020020021 is an apocalyptic number.
It is an amenable number.
110020020021 is a deficient number, since it is larger than the sum of its proper divisors (49201651627).
110020020021 is a wasteful number, since it uses less digits than its factorization.
110020020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23374232 (or 23374229 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 110020020021 its reverse (120020020011), we get a palindrome (230040040032).
The spelling of 110020020021 in words is "one hundred ten billion, twenty million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •