Base | Representation |
---|---|
bin | 1010001101001110000010… |
… | …0000001001010001000101 |
3 | 1110201211111212212012121021 |
4 | 2203103200200021101011 |
5 | 2432331102100200401 |
6 | 35511230040551141 |
7 | 2235531046313614 |
oct | 243234040112105 |
9 | 43654455765537 |
10 | 11222221100101 |
11 | 3637354280550 |
12 | 1312b371824b1 |
13 | 63533532956b |
14 | 2ab23090d87b |
15 | 146db08832a1 |
hex | a34e0809445 |
11222221100101 has 24 divisors (see below), whose sum is σ = 12423462573024. Its totient is φ = 10053115800000.
The previous prime is 11222221100093. The next prime is 11222221100137. The reversal of 11222221100101 is 10100112222211.
It is not a de Polignac number, because 11222221100101 - 23 = 11222221100093 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 (11222221100161) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23439531 + ... + 23913511.
It is an arithmetic number, because the mean of its divisors is an integer number (517644273876).
Almost surely, 211222221100101 is an apocalyptic number.
11222221100101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11222221100101 is a deficient number, since it is larger than the sum of its proper divisors (1201241472923).
11222221100101 is a wasteful number, since it uses less digits than its factorization.
11222221100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474405 (or 474304 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11222221100101 its reverse (10100112222211), we get a palindrome (21322333322312).
The spelling of 11222221100101 in words is "eleven trillion, two hundred twenty-two billion, two hundred twenty-one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.700 sec. • engine limits •