Base | Representation |
---|---|
bin | 11001001111100011100010… |
… | …001110000011010000111011 |
3 | 112120002102022100111010010210 |
4 | 121033203202032003100323 |
5 | 104022423141130014321 |
6 | 1032041533501242203 |
7 | 32245636551460665 |
oct | 3117434216032073 |
9 | 476072270433123 |
10 | 111020110001211 |
11 | 324134008976a4 |
12 | 10550536263363 |
13 | 49c41c797a6a8 |
14 | 1d5b58b105535 |
15 | cc7d4b6c2b76 |
hex | 64f8e238343b |
111020110001211 has 8 divisors (see below), whose sum is σ = 148561206163984. Its totient is φ = 73746210252960.
The previous prime is 111020110001209. The next prime is 111020110001221. The reversal of 111020110001211 is 112100011020111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111020110001211 - 21 = 111020110001209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111020110001221) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 66799102660 + ... + 66799104321.
It is an arithmetic number, because the mean of its divisors is an integer number (18570150770498).
Almost surely, 2111020110001211 is an apocalyptic number.
111020110001211 is a deficient number, since it is larger than the sum of its proper divisors (37541096162773).
111020110001211 is a wasteful number, since it uses less digits than its factorization.
111020110001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133598207261.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111020110001211 its reverse (112100011020111), we get a palindrome (223120121021322).
The spelling of 111020110001211 in words is "one hundred eleven trillion, twenty billion, one hundred ten million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •