Base | Representation |
---|---|
bin | 110011110101011011… |
… | …0100111000010010001 |
3 | 101122022200121201101212 |
4 | 1213222312213002101 |
5 | 3310432434212414 |
6 | 123045341105505 |
7 | 11020321335035 |
oct | 1475266470221 |
9 | 348280551355 |
10 | 111314366609 |
11 | 43232070206 |
12 | 196a6b58295 |
13 | a65c8c5124 |
14 | 555d9a41c5 |
15 | 2d676c483e |
hex | 19eada7091 |
111314366609 has 2 divisors, whose sum is σ = 111314366610. Its totient is φ = 111314366608.
The previous prime is 111314366489. The next prime is 111314366627. The reversal of 111314366609 is 906663413111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111070225984 + 244140625 = 333272^2 + 15625^2 .
It is a cyclic number.
It is not a de Polignac number, because 111314366609 - 28 = 111314366353 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (111314362609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55657183304 + 55657183305.
It is an arithmetic number, because the mean of its divisors is an integer number (55657183305).
Almost surely, 2111314366609 is an apocalyptic number.
It is an amenable number.
111314366609 is a deficient number, since it is larger than the sum of its proper divisors (1).
111314366609 is an equidigital number, since it uses as much as digits as its factorization.
111314366609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 41.
The spelling of 111314366609 in words is "one hundred eleven billion, three hundred fourteen million, three hundred sixty-six thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.036 sec. • engine limits •