Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …101111101011011110100001 |
3 | 112120102000100201100011011211 |
4 | 121100313100233223132201 |
5 | 104030411300322440001 |
6 | 1032151122350510121 |
7 | 32255301440524306 |
oct | 3120672057533641 |
9 | 476360321304154 |
10 | 111110011140001 |
11 | 32448544724905 |
12 | 10565a45b05341 |
13 | 49cc8241675c3 |
14 | 1d61a78c2b0ad |
15 | cca35e022351 |
hex | 650dd0beb7a1 |
111110011140001 has 2 divisors, whose sum is σ = 111110011140002. Its totient is φ = 111110011140000.
The previous prime is 111110011139947. The next prime is 111110011140019. The reversal of 111110011140001 is 100041110011111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86478393989376 + 24631617150625 = 9299376^2 + 4963025^2 .
It is a cyclic number.
It is not a de Polignac number, because 111110011140001 - 27 = 111110011139873 is a prime.
It is a super-2 number, since 2×1111100111400012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111110011140071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555005570000 + 55555005570001.
It is an arithmetic number, because the mean of its divisors is an integer number (55555005570001).
Almost surely, 2111110011140001 is an apocalyptic number.
It is an amenable number.
111110011140001 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110011140001 is an equidigital number, since it uses as much as digits as its factorization.
111110011140001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111110011140001 its reverse (100041110011111), we get a palindrome (211151121151112).
The spelling of 111110011140001 in words is "one hundred eleven trillion, one hundred ten billion, eleven million, one hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •