Base | Representation |
---|---|
bin | 11001011000111001000011… |
… | …011000100000110010000101 |
3 | 112122100202100011221012111111 |
4 | 121120321003120200302011 |
5 | 104113431120201314423 |
6 | 1033252401121005021 |
7 | 32343201530631043 |
oct | 3130710330406205 |
9 | 478322304835444 |
10 | 111661690260613 |
11 | 32640503157539 |
12 | 1063494a183771 |
13 | 4a3c862ba0b8c |
14 | 1d8065178d393 |
15 | cd989bb2760d |
hex | 658e43620c85 |
111661690260613 has 8 divisors (see below), whose sum is σ = 111716474620608. Its totient is φ = 111606918629184.
The previous prime is 111661690260599. The next prime is 111661690260643. The reversal of 111661690260613 is 316062096166111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111661690260613 - 245 = 76477318171781 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111661690260643) 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 in 7 ways as a sum of consecutive naturals, for example, 14391006 + ... + 20746672.
It is an arithmetic number, because the mean of its divisors is an integer number (13964559327576).
Almost surely, 2111661690260613 is an apocalyptic number.
It is an amenable number.
111661690260613 is a deficient number, since it is larger than the sum of its proper divisors (54784359995).
111661690260613 is an equidigital number, since it uses as much as digits as its factorization.
111661690260613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6364283.
The product of its (nonzero) digits is 419904, while the sum is 49.
The spelling of 111661690260613 in words is "one hundred eleven trillion, six hundred sixty-one billion, six hundred ninety million, two hundred sixty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •