Base | Representation |
---|---|
bin | 11001001111011011001111… |
… | …001001001000101100000011 |
3 | 112120001120022101202201100202 |
4 | 121033123033021020230003 |
5 | 104022301414200323021 |
6 | 1032033501413235415 |
7 | 32245203011013116 |
oct | 3117331711105403 |
9 | 476046271681322 |
10 | 111011200011011 |
11 | 3240a649394133 |
12 | 1054a86a332b6b |
13 | 49c3407a53941 |
14 | 1d5ad83a4057d |
15 | cc79c9375a0b |
hex | 64f6cf248b03 |
111011200011011 has 16 divisors (see below), whose sum is σ = 120413660814720. Its totient is φ = 101928127749120.
The previous prime is 111011200011007. The next prime is 111011200011053. The reversal of 111011200011011 is 110110002110111.
It is a happy number.
It is not a de Polignac number, because 111011200011011 - 22 = 111011200011007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111011200010983 and 111011200011001.
It is not an unprimeable number, because it can be changed into a prime (111011200011511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11575325 + ... + 18868241.
It is an arithmetic number, because the mean of its divisors is an integer number (7525853800920).
Almost surely, 2111011200011011 is an apocalyptic number.
111011200011011 is a deficient number, since it is larger than the sum of its proper divisors (9402460803709).
111011200011011 is a wasteful number, since it uses less digits than its factorization.
111011200011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7314814.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 111011200011011 its reverse (110110002110111), we get a palindrome (221121202121122).
The spelling of 111011200011011 in words is "one hundred eleven trillion, eleven billion, two hundred million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •