Base | Representation |
---|---|
bin | 11001010011110001101101… |
… | …100111001101110110001011 |
3 | 112121010011010000112010122010 |
4 | 121103301231213031312023 |
5 | 104042201303112040021 |
6 | 1032423112154031003 |
7 | 32305616543145333 |
oct | 3123615547156613 |
9 | 477104100463563 |
10 | 111310211440011 |
11 | 32515439563401 |
12 | 105987b8718463 |
13 | 4a1567ab1749c |
14 | 1d6b62b76c0c3 |
15 | cd0679d5e976 |
hex | 653c6d9cdd8b |
111310211440011 has 8 divisors (see below), whose sum is σ = 148417371672064. Its totient is φ = 74204929417320.
The previous prime is 111310211439983. The next prime is 111310211440037. The reversal of 111310211440011 is 110044112013111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111310211440011 - 25 = 111310211439979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111310211440011.
It is not an unprimeable number, because it can be changed into a prime (111310211440061) 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, 469414051 + ... + 469651116.
It is an arithmetic number, because the mean of its divisors is an integer number (18552171459008).
Almost surely, 2111310211440011 is an apocalyptic number.
111310211440011 is a deficient number, since it is larger than the sum of its proper divisors (37107160232053).
111310211440011 is an equidigital number, since it uses as much as digits as its factorization.
111310211440011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 939104681.
The product of its (nonzero) digits is 96, while the sum is 21.
Adding to 111310211440011 its reverse (110044112013111), we get a palindrome (221354323453122).
The spelling of 111310211440011 in words is "one hundred eleven trillion, three hundred ten billion, two hundred eleven million, four hundred forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •