Base | Representation |
---|---|
bin | 110011010001100100… |
… | …1010010000110000101 |
3 | 101112012211211201001011 |
4 | 1212203021102012011 |
5 | 3301001443131041 |
6 | 122330123202221 |
7 | 10645442424100 |
oct | 1464311220605 |
9 | 345184751034 |
10 | 110111302021 |
11 | 42774a60a56 |
12 | 19410076371 |
13 | a4ca599aa6 |
14 | 5487cb7737 |
15 | 2ce6c80e81 |
hex | 19a3252185 |
110111302021 has 24 divisors (see below), whose sum is σ = 140299980120. Its totient is φ = 85766188032.
The previous prime is 110111301959. The next prime is 110111302051. The reversal of 110111302021 is 120203111011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 67800868996 + 42310433025 = 260386^2 + 205695^2 .
It is not a de Polignac number, because 110111302021 - 227 = 109977084293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110111301992 and 110111302010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110111302051) 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, 2254920 + ... + 2303233.
It is an arithmetic number, because the mean of its divisors is an integer number (5845832505).
Almost surely, 2110111302021 is an apocalyptic number.
It is an amenable number.
110111302021 is a deficient number, since it is larger than the sum of its proper divisors (30188678099).
110111302021 is a wasteful number, since it uses less digits than its factorization.
110111302021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4558213 (or 4558206 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110111302021 its reverse (120203111011), we get a palindrome (230314413032).
The spelling of 110111302021 in words is "one hundred ten billion, one hundred eleven million, three hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •