Base | Representation |
---|---|
bin | 11001001111011011111111… |
… | …011110110100010100100001 |
3 | 112120001122101220210021122111 |
4 | 121033123333132310110201 |
5 | 104022310044304013441 |
6 | 1032034114103435321 |
7 | 32245232056221556 |
oct | 3117337736642441 |
9 | 476048356707574 |
10 | 111012011001121 |
11 | 3240aa25150a9a |
12 | 1054aa55a55b41 |
13 | 49c3506a83c49 |
14 | 1d5b01d62aa2d |
15 | cc7a2566e081 |
hex | 64f6ff7b4521 |
111012011001121 has 8 divisors (see below), whose sum is σ = 114976563143400. Its totient is φ = 107184010598224.
The previous prime is 111012011001079. The next prime is 111012011001127. The reversal of 111012011001121 is 121100110210111.
It can be written as a sum of positive squares in 4 ways, for example, as 4331289380625 + 106680721620496 = 2081175^2 + 10328636^2 .
It is not a de Polignac number, because 111012011001121 - 219 = 111012010476833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111012011001127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2275837906 + ... + 2275886683.
It is an arithmetic number, because the mean of its divisors is an integer number (14372070392925).
Almost surely, 2111012011001121 is an apocalyptic number.
It is an amenable number.
111012011001121 is a deficient number, since it is larger than the sum of its proper divisors (3964552142279).
111012011001121 is an frugal number, since it uses more digits than its factorization.
111012011001121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4551724676 (or 4551724618 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111012011001121 its reverse (121100110210111), we get a palindrome (232112121211232).
The spelling of 111012011001121 in words is "one hundred eleven trillion, twelve billion, eleven million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •