Base | Representation |
---|---|
bin | 110011110010000001… |
… | …1001001000001000101 |
3 | 101122000201211000100211 |
4 | 1213210003021001011 |
5 | 3310214223223023 |
6 | 123030142235421 |
7 | 11014434124633 |
oct | 1474403110105 |
9 | 348021730324 |
10 | 111200211013 |
11 | 43183690441 |
12 | 19674885b71 |
13 | a642066438 |
14 | 554c76a353 |
15 | 2d5c675a0d |
hex | 19e40c9045 |
111200211013 has 2 divisors, whose sum is σ = 111200211014. Its totient is φ = 111200211012.
The previous prime is 111200211007. The next prime is 111200211041. The reversal of 111200211013 is 310112002111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78409520289 + 32790690724 = 280017^2 + 181082^2 .
It is a cyclic number.
It is not a de Polignac number, because 111200211013 - 229 = 110663340101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111200210984 and 111200211002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111200211313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55600105506 + 55600105507.
It is an arithmetic number, because the mean of its divisors is an integer number (55600105507).
Almost surely, 2111200211013 is an apocalyptic number.
It is an amenable number.
111200211013 is a deficient number, since it is larger than the sum of its proper divisors (1).
111200211013 is an equidigital number, since it uses as much as digits as its factorization.
111200211013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 111200211013 its reverse (310112002111), we get a palindrome (421312213124).
The spelling of 111200211013 in words is "one hundred eleven billion, two hundred million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •