Base | Representation |
---|---|
bin | 110011101100011111… |
… | …1101000011010111101 |
3 | 101121112210211012021202 |
4 | 1213120333220122331 |
5 | 3304324233213233 |
6 | 122555515105245 |
7 | 11010022510022 |
oct | 1473077503275 |
9 | 347483735252 |
10 | 111014741693 |
11 | 43098a22609 |
12 | 19622742225 |
13 | a6127c8c8b |
14 | 5531c8b549 |
15 | 2d4b23bbe8 |
hex | 19d8fe86bd |
111014741693 has 2 divisors, whose sum is σ = 111014741694. Its totient is φ = 111014741692.
The previous prime is 111014741639. The next prime is 111014741713. The reversal of 111014741693 is 396147410111.
Together with previous prime (111014741639) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67157167609 + 43857574084 = 259147^2 + 209422^2 .
It is a cyclic number.
It is not a de Polignac number, because 111014741693 - 28 = 111014741437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111014741393) 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 as a sum of consecutive naturals, namely, 55507370846 + 55507370847.
It is an arithmetic number, because the mean of its divisors is an integer number (55507370847).
Almost surely, 2111014741693 is an apocalyptic number.
It is an amenable number.
111014741693 is a deficient number, since it is larger than the sum of its proper divisors (1).
111014741693 is an equidigital number, since it uses as much as digits as its factorization.
111014741693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 38.
The spelling of 111014741693 in words is "one hundred eleven billion, fourteen million, seven hundred forty-one thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •