Base | Representation |
---|---|
bin | 11001000011111100001111… |
… | …001110010000001111000000 |
3 | 112110021010020202210202110111 |
4 | 121003330033032100033000 |
5 | 103421334124241041000 |
6 | 1030231142134041104 |
7 | 32134163640033331 |
oct | 3103741716201700 |
9 | 473233222722414 |
10 | 110222001112000 |
11 | 32135985167488 |
12 | 104419191a9194 |
13 | 4966b757417ab |
14 | 1d30ab7db2288 |
15 | cb21d9434cba |
hex | 643f0f3903c0 |
110222001112000 has 56 divisors (see below), whose sum is σ = 272964785773680. Its totient is φ = 44088800441600.
The previous prime is 110222001111931. The next prime is 110222001112009. The reversal of 110222001112000 is 211100222011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110222001112009) 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, 6888867070 + ... + 6888883069.
It is an arithmetic number, because the mean of its divisors is an integer number (4874371174530).
Almost surely, 2110222001112000 is an apocalyptic number.
110222001112000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110222001112000 is an abundant number, since it is smaller than the sum of its proper divisors (162742784661680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110222001112000 is an equidigital number, since it uses as much as digits as its factorization.
110222001112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13777750166 (or 13777750146 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110222001112000 its reverse (211100222011), we get a palindrome (110433101334011).
The spelling of 110222001112000 in words is "one hundred ten trillion, two hundred twenty-two billion, one million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •