Base | Representation |
---|---|
bin | 11001001111011011001111… |
… | …010000101110110001011011 |
3 | 112120001120022112111212111111 |
4 | 121033123033100232301123 |
5 | 104022301420203031021 |
6 | 1032033501524041151 |
7 | 32245203033644563 |
oct | 3117331720566133 |
9 | 476046275455444 |
10 | 111011202002011 |
11 | 3240a64a523a93 |
12 | 1054a86ab331b7 |
13 | 49c340829cc4c |
14 | 1d5ad83ddbda3 |
15 | cc79c961a8e1 |
hex | 64f6cf42ec5b |
111011202002011 has 4 divisors (see below), whose sum is σ = 111011837394024. Its totient is φ = 111010566610000.
The previous prime is 111011202001993. The next prime is 111011202002023. The reversal of 111011202002011 is 110200202110111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111011202002011 - 27 = 111011202001883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111011202001982 and 111011202002000.
It is not an unprimeable number, because it can be changed into a prime (111011202002411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 317433865 + ... + 317783386.
It is an arithmetic number, because the mean of its divisors is an integer number (27752959348506).
Almost surely, 2111011202002011 is an apocalyptic number.
111011202002011 is a deficient number, since it is larger than the sum of its proper divisors (635392013).
111011202002011 is an equidigital number, since it uses as much as digits as its factorization.
111011202002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635392012.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111011202002011 its reverse (110200202110111), we get a palindrome (221211404112122).
The spelling of 111011202002011 in words is "one hundred eleven trillion, eleven billion, two hundred two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •