Base | Representation |
---|---|
bin | 110011110010100111… |
… | …1011100000100100101 |
3 | 101122002010110011120022 |
4 | 1213211033130010211 |
5 | 3310234333241010 |
6 | 123032135044525 |
7 | 11015066126600 |
oct | 1474517340445 |
9 | 348063404508 |
10 | 111220212005 |
11 | 43193a01491 |
12 | 1967b510745 |
13 | a64624a146 |
14 | 5551295337 |
15 | 2d5e2c6d55 |
hex | 19e53dc125 |
111220212005 has 24 divisors (see below), whose sum is σ = 156387627288. Its totient is φ = 75708584448.
The previous prime is 111220211981. The next prime is 111220212013. The reversal of 111220212005 is 500212022111.
It can be written as a sum of positive squares in 4 ways, for example, as 41499393796 + 69720818209 = 203714^2 + 264047^2 .
It is not a de Polignac number, because 111220212005 - 26 = 111220211941 is a prime.
It is a super-2 number, since 2×1112202120052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1623224 + ... + 1690353.
It is an arithmetic number, because the mean of its divisors is an integer number (6516151137).
Almost surely, 2111220212005 is an apocalyptic number.
It is an amenable number.
111220212005 is a deficient number, since it is larger than the sum of its proper divisors (45167415283).
111220212005 is a wasteful number, since it uses less digits than its factorization.
111220212005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3313733 (or 3313726 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 111220212005 its reverse (500212022111), we get a palindrome (611432234116).
The spelling of 111220212005 in words is "one hundred eleven billion, two hundred twenty million, two hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •