Base | Representation |
---|---|
bin | 11001001111011011001111… |
… | …001001001000011100010010 |
3 | 112120001120022101202122222101 |
4 | 121033123033021020130102 |
5 | 104022301414200310002 |
6 | 1032033501413231014 |
7 | 32245203011010145 |
oct | 3117331711103422 |
9 | 476046271678871 |
10 | 111011200010002 |
11 | 3240a6493933a6 |
12 | 1054a86a33246a |
13 | 49c3407a53346 |
14 | 1d5ad83a4005c |
15 | cc79c9375587 |
hex | 64f6cf248712 |
111011200010002 has 8 divisors (see below), whose sum is σ = 172258758636300. Its totient is φ = 53591613797904.
The previous prime is 111011200009999. The next prime is 111011200010003. The reversal of 111011200010002 is 200010002110111.
It can be written as a sum of positive squares in 2 ways, for example, as 95231230305201 + 15779969704801 = 9758649^2 + 3972401^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (111011200010003) 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 3 ways as a sum of consecutive naturals, for example, 956993103477 + ... + 956993103592.
Almost surely, 2111011200010002 is an apocalyptic number.
111011200010002 is a deficient number, since it is larger than the sum of its proper divisors (61247558626298).
111011200010002 is a wasteful number, since it uses less digits than its factorization.
111011200010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1913986207100.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 111011200010002 its reverse (200010002110111), we get a palindrome (311021202120113).
The spelling of 111011200010002 in words is "one hundred eleven trillion, eleven billion, two hundred million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •