Base | Representation |
---|---|
bin | 1010000110001110010000… |
… | …0101000000010011110101 |
3 | 1110022100021000001202222010 |
4 | 2201203210011000103311 |
5 | 2423343420113310401 |
6 | 35340110513154433 |
7 | 2224044312024111 |
oct | 241434405002365 |
9 | 43270230052863 |
10 | 11102022010101 |
11 | 35a0382aa5140 |
12 | 12b379085ba19 |
13 | 626bbab16179 |
14 | 2a54aad80741 |
15 | 143bc81a2ed6 |
hex | a18e41404f5 |
11102022010101 has 32 divisors (see below), whose sum is σ = 16316448768000. Its totient is φ = 6658542792000.
The previous prime is 11102022010033. The next prime is 11102022010109. The reversal of 11102022010101 is 10101022020111.
It is not a de Polignac number, because 11102022010101 - 222 = 11102017815797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102022010109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5829516 + ... + 7495818.
It is an arithmetic number, because the mean of its divisors is an integer number (509889024000).
Almost surely, 211102022010101 is an apocalyptic number.
11102022010101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11102022010101 is a deficient number, since it is larger than the sum of its proper divisors (5214426757899).
11102022010101 is a wasteful number, since it uses less digits than its factorization.
11102022010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1668417.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11102022010101 its reverse (10101022020111), we get a palindrome (21203044030212).
The spelling of 11102022010101 in words is "eleven trillion, one hundred two billion, twenty-two million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •