Base | Representation |
---|---|
bin | 11001001111010001110110… |
… | …010101010101001011101111 |
3 | 112120000121021220122020110011 |
4 | 121033101312111111023233 |
5 | 104022120243221213403 |
6 | 1032025113253554051 |
7 | 32244365143131511 |
oct | 3117216625251357 |
9 | 476017256566404 |
10 | 111001120101103 |
11 | 3240634655a681 |
12 | 10548916645927 |
13 | 49c248c6380cb |
14 | 1d5a6a9039bb1 |
15 | cc75d9480a6d |
hex | 64f4765552ef |
111001120101103 has 2 divisors, whose sum is σ = 111001120101104. Its totient is φ = 111001120101102.
The previous prime is 111001120101013. The next prime is 111001120101107. The reversal of 111001120101103 is 301101021100111.
Together with previous prime (111001120101013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (301101021100111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111001120101103 - 225 = 111001086546671 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111001120101107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55500560050551 + 55500560050552.
It is an arithmetic number, because the mean of its divisors is an integer number (55500560050552).
Almost surely, 2111001120101103 is an apocalyptic number.
111001120101103 is a deficient number, since it is larger than the sum of its proper divisors (1).
111001120101103 is an equidigital number, since it uses as much as digits as its factorization.
111001120101103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 111001120101103 its reverse (301101021100111), we get a palindrome (412102141201214).
The spelling of 111001120101103 in words is "one hundred eleven trillion, one billion, one hundred twenty million, one hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •