Base | Representation |
---|---|
bin | 11001000010010101111001… |
… | …001101110001101110001101 |
3 | 112102212121121021201011011201 |
4 | 121002111321031301232031 |
5 | 103413034100204102341 |
6 | 1030104445522545501 |
7 | 32123223511630432 |
oct | 3102257115615615 |
9 | 472777537634151 |
10 | 110112110222221 |
11 | 320a3313670508 |
12 | 1042456ab08291 |
13 | 49596b1a27c63 |
14 | 1d296514b1b89 |
15 | cae406be1331 |
hex | 642579371b8d |
110112110222221 has 8 divisors (see below), whose sum is σ = 112007300156640. Its totient is φ = 108217883053968.
The previous prime is 110112110222117. The next prime is 110112110222239. The reversal of 110112110222221 is 122222011211011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110112110222221 - 227 = 110111976004493 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110112110222251) 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, 240460831 + ... + 240918316.
It is an arithmetic number, because the mean of its divisors is an integer number (14000912519580).
Almost surely, 2110112110222221 is an apocalyptic number.
It is an amenable number.
110112110222221 is a deficient number, since it is larger than the sum of its proper divisors (1895189934419).
110112110222221 is an equidigital number, since it uses as much as digits as its factorization.
110112110222221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481383083.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 110112110222221 its reverse (122222011211011), we get a palindrome (232334121433232).
The spelling of 110112110222221 in words is "one hundred ten trillion, one hundred twelve billion, one hundred ten million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •