Base | Representation |
---|---|
bin | 11001010000101110011101… |
… | …100000011001001000110001 |
3 | 112120101002222011021202111112 |
4 | 121100232131200121020301 |
5 | 104030232422224410423 |
6 | 1032142520545323105 |
7 | 32254515325443566 |
oct | 3120563540311061 |
9 | 476332864252445 |
10 | 111100561560113 |
11 | 32444535684654 |
12 | 10564049336495 |
13 | 49cb979506908 |
14 | 1d6141dc2686d |
15 | cc9ea963ba78 |
hex | 650b9d819231 |
111100561560113 has 8 divisors (see below), whose sum is σ = 111563464190976. Its totient is φ = 110637819810000.
The previous prime is 111100561560059. The next prime is 111100561560133. The reversal of 111100561560113 is 311065165001111.
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 111100561560113 - 210 = 111100561559089 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 111100561560113.
It is not an unprimeable number, because it can be changed into a prime (111100561560133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38836058 + ... + 41598563.
It is an arithmetic number, because the mean of its divisors is an integer number (13945433023872).
Almost surely, 2111100561560113 is an apocalyptic number.
It is an amenable number.
111100561560113 is a deficient number, since it is larger than the sum of its proper divisors (462902630863).
111100561560113 is an equidigital number, since it uses as much as digits as its factorization.
111100561560113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80440375.
The product of its (nonzero) digits is 2700, while the sum is 32.
The spelling of 111100561560113 in words is "one hundred eleven trillion, one hundred billion, five hundred sixty-one million, five hundred sixty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •