Base | Representation |
---|---|
bin | 110011110101010101… |
… | …0100110110100110101 |
3 | 101122022110200212002120 |
4 | 1213222222212310311 |
5 | 3310431133020041 |
6 | 123045145430153 |
7 | 11020252521231 |
oct | 1475252466465 |
9 | 348273625076 |
10 | 111311220021 |
11 | 43230311121 |
12 | 196a5a9b359 |
13 | a65c062b41 |
14 | 555d3c55c1 |
15 | 2d672a2366 |
hex | 19eaaa6d35 |
111311220021 has 4 divisors (see below), whose sum is σ = 148414960032. Its totient is φ = 74207480012.
The previous prime is 111311220001. The next prime is 111311220067. The reversal of 111311220021 is 120022113111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111311220021 - 27 = 111311219893 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111311220001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18551870001 + ... + 18551870006.
It is an arithmetic number, because the mean of its divisors is an integer number (37103740008).
Almost surely, 2111311220021 is an apocalyptic number.
It is an amenable number.
111311220021 is a deficient number, since it is larger than the sum of its proper divisors (37103740011).
111311220021 is an equidigital number, since it uses as much as digits as its factorization.
111311220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37103740010.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 111311220021 its reverse (120022113111), we get a palindrome (231333333132).
The spelling of 111311220021 in words is "one hundred eleven billion, three hundred eleven million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •