Base | Representation |
---|---|
bin | 11001001111011011000011… |
… | …110100011000101001110001 |
3 | 112120001112211011021021102202 |
4 | 121033123003310120221301 |
5 | 104022301022031201001 |
6 | 1032033430505152545 |
7 | 32245165213102235 |
oct | 3117330364305161 |
9 | 476045734237382 |
10 | 111011010022001 |
11 | 3240a561119621 |
12 | 1054a81678b755 |
13 | 49c33a75931cb |
14 | 1d5ad667065c5 |
15 | cc79b784796b |
hex | 64f6c3d18a71 |
111011010022001 has 8 divisors (see below), whose sum is σ = 111121577647680. Its totient is φ = 110900445587568.
The previous prime is 111011010021991. The next prime is 111011010022007. The reversal of 111011010022001 is 100220010110111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111011010022001 is a prime.
It is a super-2 number, since 2×1110110100220012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111011010022007) 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, 72124475 + ... + 73647551.
It is an arithmetic number, because the mean of its divisors is an integer number (13890197205960).
Almost surely, 2111011010022001 is an apocalyptic number.
It is an amenable number.
111011010022001 is a deficient number, since it is larger than the sum of its proper divisors (110567625679).
111011010022001 is a wasteful number, since it uses less digits than its factorization.
111011010022001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1595623.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111011010022001 its reverse (100220010110111), we get a palindrome (211231020132112).
The spelling of 111011010022001 in words is "one hundred eleven trillion, eleven billion, ten million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •