Base | Representation |
---|---|
bin | 11001001111100100011000… |
… | …100101001000000110110101 |
3 | 112120002111122220121110202020 |
4 | 121033210120211020012311 |
5 | 104022432023114120041 |
6 | 1032042204201103353 |
7 | 32246001264504651 |
oct | 3117443045100665 |
9 | 476074586543666 |
10 | 111021022020021 |
11 | 32413829688953 |
12 | 1055074b787b59 |
13 | 49c43118c17a9 |
14 | 1d5b6362ada61 |
15 | cc7da17c5866 |
hex | 64f9189481b5 |
111021022020021 has 4 divisors (see below), whose sum is σ = 148028029360032. Its totient is φ = 74014014680012.
The previous prime is 111021022019983. The next prime is 111021022020043. The reversal of 111021022020021 is 120020220120111.
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 111021022020021 - 241 = 108821998764469 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111021022060021) 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, 18503503670001 + ... + 18503503670006.
It is an arithmetic number, because the mean of its divisors is an integer number (37007007340008).
Almost surely, 2111021022020021 is an apocalyptic number.
It is an amenable number.
111021022020021 is a deficient number, since it is larger than the sum of its proper divisors (37007007340011).
111021022020021 is an equidigital number, since it uses as much as digits as its factorization.
111021022020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37007007340010.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 111021022020021 its reverse (120020220120111), we get a palindrome (231041242140132).
The spelling of 111021022020021 in words is "one hundred eleven trillion, twenty-one billion, twenty-two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •