Base | Representation |
---|---|
bin | 110011101101110000… |
… | …1010110110000101001 |
3 | 101121122202121002021111 |
4 | 1213123201112300221 |
5 | 3304421111333211 |
6 | 123004031510321 |
7 | 11011046041411 |
oct | 1473341266051 |
9 | 347582532244 |
10 | 111057136681 |
11 | 4310a949597 |
12 | 196349883a1 |
13 | a61b52097a |
14 | 5537765641 |
15 | 2d4ed13421 |
hex | 19db856c29 |
111057136681 has 8 divisors (see below), whose sum is σ = 111299495040. Its totient is φ = 110814874128.
The previous prime is 111057136679. The next prime is 111057136693. The reversal of 111057136681 is 186631750111.
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 111057136681 - 21 = 111057136679 is a prime.
It is a super-2 number, since 2×1110571366812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111057131681) 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, 2608890 + ... + 2651116.
It is an arithmetic number, because the mean of its divisors is an integer number (13912436880).
Almost surely, 2111057136681 is an apocalyptic number.
It is an amenable number.
111057136681 is a deficient number, since it is larger than the sum of its proper divisors (242358359).
111057136681 is an equidigital number, since it uses as much as digits as its factorization.
111057136681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47903.
The product of its (nonzero) digits is 30240, while the sum is 40.
Adding to 111057136681 its reverse (186631750111), we get a palindrome (297688886792).
The spelling of 111057136681 in words is "one hundred eleven billion, fifty-seven million, one hundred thirty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •