Base | Representation |
---|---|
bin | 1010000110001110010000… |
… | …0101010110110001010100 |
3 | 1110022100021000020110011111 |
4 | 2201203210011112301110 |
5 | 2423343420124231400 |
6 | 35340110515144404 |
7 | 2224044312556246 |
oct | 241434405266124 |
9 | 43270230213144 |
10 | 11102022102100 |
11 | 35a0383058276 |
12 | 12b37908a5104 |
13 | 626bbab48cc7 |
14 | 2a54aada6096 |
15 | 143bc81c03ba |
hex | a18e4156c54 |
11102022102100 has 18 divisors (see below), whose sum is σ = 24091387961774. Its totient is φ = 4440808840800.
The previous prime is 11102022102089. The next prime is 11102022102107. The reversal of 11102022102100 is 120122020111.
It can be written as a sum of positive squares in 3 ways, for example, as 2447234724496 + 8654787377604 = 1564364^2 + 2941902^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102022102107) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55510110411 + ... + 55510110610.
Almost surely, 211102022102100 is an apocalyptic number.
11102022102100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102022102100 is an abundant number, since it is smaller than the sum of its proper divisors (12989365859674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102022102100 is a wasteful number, since it uses less digits than its factorization.
11102022102100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111020221035 (or 111020221028 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11102022102100 its reverse (120122020111), we get a palindrome (11222144122211).
The spelling of 11102022102100 in words is "eleven trillion, one hundred two billion, twenty-two million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •