Base | Representation |
---|---|
bin | 1100110111101010110… |
… | …1100111110100010110 |
3 | 210010200222122001012221 |
4 | 3031322231213310112 |
5 | 12110304120041042 |
6 | 245323425332554 |
7 | 21655054641331 |
oct | 3157255476426 |
9 | 703628561187 |
10 | 221102112022 |
11 | 85850418300 |
12 | 36a2679715a |
13 | 17b08136bac |
14 | a9b68d5618 |
15 | 5b40d41d67 |
hex | 337ab67d16 |
221102112022 has 24 divisors (see below), whose sum is σ = 368153782416. Its totient is φ = 99505890000.
The previous prime is 221102112017. The next prime is 221102112031. The reversal of 221102112022 is 220211201122.
It is a happy number.
It is a super-2 number, since 2×2211021120222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 221102111987 and 221102112005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4498554 + ... + 4547437.
It is an arithmetic number, because the mean of its divisors is an integer number (15339740934).
Almost surely, 2221102112022 is an apocalyptic number.
221102112022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
221102112022 is a deficient number, since it is larger than the sum of its proper divisors (147051670394).
221102112022 is a wasteful number, since it uses less digits than its factorization.
221102112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9046116 (or 9046105 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 221102112022 its reverse (220211201122), we get a palindrome (441313313144).
The spelling of 221102112022 in words is "two hundred twenty-one billion, one hundred two million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •