Base | Representation |
---|---|
bin | 110011110010101011… |
… | …0010101100000001001 |
3 | 101122002020212000210222 |
4 | 1213211112111200021 |
5 | 3310240314120410 |
6 | 123032241515425 |
7 | 11015120400200 |
oct | 1474526254011 |
9 | 348066760728 |
10 | 111222020105 |
11 | 43194a26989 |
12 | 19680042b75 |
13 | a646731121 |
14 | 5551606237 |
15 | 2d5e532955 |
hex | 19e5595809 |
111222020105 has 48 divisors (see below), whose sum is σ = 158122892880. Its totient is φ = 74863756800.
The previous prime is 111222020087. The next prime is 111222020111. The reversal of 111222020105 is 501020222111.
It can be written as a sum of positive squares in 8 ways, for example, as 34490804089 + 76731216016 = 185717^2 + 277004^2 .
It is not a de Polignac number, because 111222020105 - 214 = 111222003721 is a prime.
It is a super-2 number, since 2×1112220201052 (a number of 23 digits) contains 22 as substring.
It is a Curzon 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 47 ways as a sum of consecutive naturals, for example, 7599695 + ... + 7614315.
It is an arithmetic number, because the mean of its divisors is an integer number (3294226935).
Almost surely, 2111222020105 is an apocalyptic number.
It is an amenable number.
111222020105 is a deficient number, since it is larger than the sum of its proper divisors (46900872775).
111222020105 is a wasteful number, since it uses less digits than its factorization.
111222020105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15210 (or 15203 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 111222020105 its reverse (501020222111), we get a palindrome (612242242216).
The spelling of 111222020105 in words is "one hundred eleven billion, two hundred twenty-two million, twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •