Base | Representation |
---|---|
bin | 11001000010001100011111… |
… | …111011000001111100001101 |
3 | 112102211122120020022120202212 |
4 | 121002030133323001330031 |
5 | 103412402420140413401 |
6 | 1030100100513400205 |
7 | 32122415515104230 |
oct | 3102143773017415 |
9 | 472748506276685 |
10 | 110102022201101 |
11 | 3209a0071a6977 |
12 | 10422614569065 |
13 | 4958764a2c4a8 |
14 | 1d28d75799417 |
15 | cae016247dbb |
hex | 64231fec1f0d |
110102022201101 has 16 divisors (see below), whose sum is σ = 125853869088000. Its totient is φ = 94355923344768.
The previous prime is 110102022201077. The next prime is 110102022201137. The reversal of 110102022201101 is 101102220201011.
It is a cyclic number.
It is not a de Polignac number, because 110102022201101 - 222 = 110102018006797 is a prime.
It is a super-2 number, since 2×1101020222011012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110102022201401) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1319351225 + ... + 1319434673.
It is an arithmetic number, because the mean of its divisors is an integer number (7865866818000).
Almost surely, 2110102022201101 is an apocalyptic number.
It is an amenable number.
110102022201101 is a deficient number, since it is larger than the sum of its proper divisors (15751846886899).
110102022201101 is an equidigital number, since it uses as much as digits as its factorization.
110102022201101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115628.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110102022201101 its reverse (101102220201011), we get a palindrome (211204242402112).
The spelling of 110102022201101 in words is "one hundred ten trillion, one hundred two billion, twenty-two million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •