Base | Representation |
---|---|
bin | 11001011000100101000000… |
… | …010011000001101001100010 |
3 | 112122021200202221211022000001 |
4 | 121120211000103001221202 |
5 | 104113103023343413432 |
6 | 1033234441055050214 |
7 | 32341510220533516 |
oct | 3130450023015142 |
9 | 478250687738001 |
10 | 111640163654242 |
11 | 32632366a25563 |
12 | 10630740b1096a |
13 | 4a3a812149882 |
14 | 1d7d5ac83a146 |
15 | cd903bd589e7 |
hex | 6589404c1a62 |
111640163654242 has 4 divisors (see below), whose sum is σ = 167460245481366. Its totient is φ = 55820081827120.
The previous prime is 111640163654231. The next prime is 111640163654333. The reversal of 111640163654242 is 242456361046111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 111188188465561 + 451975188681 = 10544581^2 + 672291^2 .
It is a super-3 number, since 3×1116401636542423 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 111640163654192 and 111640163654201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27910040913559 + ... + 27910040913562.
Almost surely, 2111640163654242 is an apocalyptic number.
111640163654242 is a deficient number, since it is larger than the sum of its proper divisors (55820081827124).
111640163654242 is an equidigital number, since it uses as much as digits as its factorization.
111640163654242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55820081827123.
The product of its (nonzero) digits is 829440, while the sum is 46.
The spelling of 111640163654242 in words is "one hundred eleven trillion, six hundred forty billion, one hundred sixty-three million, six hundred fifty-four thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •