Base | Representation |
---|---|
bin | 11001000010010101111110… |
… | …101000111001111110110101 |
3 | 112102212121211121221022200121 |
4 | 121002111332220321332311 |
5 | 103413034242003020041 |
6 | 1030104502533211541 |
7 | 32123225665250230 |
oct | 3102257650717665 |
9 | 472777747838617 |
10 | 110112201220021 |
11 | 320a335aa73500 |
12 | 10424595490bb1 |
13 | 49596c7839100 |
14 | 1d2965d5dc417 |
15 | cae40ebb87d1 |
hex | 64257ea39fb5 |
110112201220021 has 72 divisors (see below), whose sum is σ = 151677439146240. Its totient is φ = 78199023576960.
The previous prime is 110112201220009. The next prime is 110112201220051. The reversal of 110112201220021 is 120022102211011.
It is not a de Polignac number, because 110112201220021 - 213 = 110112201211829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110112201219977 and 110112201220004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110112201220051) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 6439651 + ... + 16176943.
Almost surely, 2110112201220021 is an apocalyptic number.
110112201220021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110112201220021 is a deficient number, since it is larger than the sum of its proper divisors (41565237926219).
110112201220021 is a wasteful number, since it uses less digits than its factorization.
110112201220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9737427 (or 9737403 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110112201220021 its reverse (120022102211011), we get a palindrome (230134303431032).
The spelling of 110112201220021 in words is "one hundred ten trillion, one hundred twelve billion, two hundred one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •