Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …1000101000000011110110 |
3 | 1110022011120210100221121111 |
4 | 2201201320020220003312 |
5 | 2423331213010120042 |
6 | 35335211101305234 |
7 | 2223651401614465 |
oct | 241417010500366 |
9 | 43264523327544 |
10 | 11100211020022 |
11 | 359a633814523 |
12 | 12b336626521a |
13 | 62698c8789c7 |
14 | 2a53786469dc |
15 | 143b1e1c8517 |
hex | a18782280f6 |
11100211020022 has 16 divisors (see below), whose sum is σ = 17203409703072. Its totient is φ = 5368690949440.
The previous prime is 11100211020007. The next prime is 11100211020043. The reversal of 11100211020022 is 22002011200111.
It is a super-3 number, since 3×111002110200223 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11100211019984 and 11100211020011.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 737450023 + ... + 737465074.
It is an arithmetic number, because the mean of its divisors is an integer number (1075213106442).
Almost surely, 211100211020022 is an apocalyptic number.
11100211020022 is a deficient number, since it is larger than the sum of its proper divisors (6103198683050).
11100211020022 is a wasteful number, since it uses less digits than its factorization.
11100211020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1474915223.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11100211020022 its reverse (22002011200111), we get a palindrome (33102222220133).
The spelling of 11100211020022 in words is "eleven trillion, one hundred billion, two hundred eleven million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •