Base | Representation |
---|---|
bin | 110011001110111000… |
… | …0111000100101110101 |
3 | 101111222112221220102101 |
4 | 1212131300320211311 |
5 | 3300310340120041 |
6 | 122313140142101 |
7 | 10643265145213 |
oct | 1463560704565 |
9 | 344875856371 |
10 | 110021020021 |
11 | 42728aa7830 |
12 | 193a5997931 |
13 | a4b49796a3 |
14 | 5479cd5cb3 |
15 | 2cddd9ab31 |
hex | 199dc38975 |
110021020021 has 8 divisors (see below), whose sum is σ = 120293868384. Its totient is φ = 99793327920.
The previous prime is 110021020013. The next prime is 110021020079. The reversal of 110021020021 is 120020120011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110021020021 - 23 = 110021020013 is a prime.
It is a super-2 number, since 2×1100210200212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110021020621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11283966 + ... + 11293711.
It is an arithmetic number, because the mean of its divisors is an integer number (15036733548).
Almost surely, 2110021020021 is an apocalyptic number.
110021020021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110021020021 is a deficient number, since it is larger than the sum of its proper divisors (10272848363).
110021020021 is a wasteful number, since it uses less digits than its factorization.
110021020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22578131.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110021020021 its reverse (120020120011), we get a palindrome (230041140032).
The spelling of 110021020021 in words is "one hundred ten billion, twenty-one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •