Base | Representation |
---|---|
bin | 11001000001000010001100… |
… | …101010100011011111101011 |
3 | 112102120000122020012121222102 |
4 | 121001002030222203133223 |
5 | 103410101023002020021 |
6 | 1025555304215444015 |
7 | 32113562504335202 |
oct | 3101021452433753 |
9 | 472500566177872 |
10 | 110022242220011 |
11 | 32069197506300 |
12 | 1040b06a38660b |
13 | 495108c3708a4 |
14 | 1d25167d34239 |
15 | cabde723a00b |
hex | 64108caa37eb |
110022242220011 has 12 divisors (see below), whose sum is σ = 127298462075400. Its totient is φ = 94755998082240.
The previous prime is 110022242219951. The next prime is 110022242220017.
It is a happy number.
110022242220011 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-110022242220011 is a prime.
It is a super-3 number, since 3×1100222422200113 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (110022242220017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23928280046 + ... + 23928284643.
It is an arithmetic number, because the mean of its divisors is an integer number (10608205172950).
Almost surely, 2110022242220011 is an apocalyptic number.
110022242220011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110022242220011 is a deficient number, since it is larger than the sum of its proper divisors (17276219855389).
110022242220011 is a wasteful number, since it uses less digits than its factorization.
110022242220011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47856564730 (or 47856564719 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
The spelling of 110022242220011 in words is "one hundred ten trillion, twenty-two billion, two hundred forty-two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •