Base | Representation |
---|---|
bin | 11001001111010000110100… |
… | …110001100101100111110011 |
3 | 112120000111110021000002112112 |
4 | 121033100310301211213303 |
5 | 104022111020133242321 |
6 | 1032024412203315535 |
7 | 32244325656210404 |
oct | 3117206461454763 |
9 | 476014407002475 |
10 | 111000020212211 |
11 | 32405931710899 |
12 | 1054866a21bbab |
13 | 49c23457c5b90 |
14 | 1d5a602d299ab |
15 | cc7572b1ca5b |
hex | 64f434c659f3 |
111000020212211 has 8 divisors (see below), whose sum is σ = 120722032646544. Its totient is φ = 101447086255200.
The previous prime is 111000020212187. The next prime is 111000020212217. The reversal of 111000020212211 is 112212020000111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111000020212211 - 230 = 110998946470387 is a prime.
It is a super-2 number, since 2×1110000202122112 (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 (111000020212217) 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, 42269617961 + ... + 42269620586.
It is an arithmetic number, because the mean of its divisors is an integer number (15090254080818).
Almost surely, 2111000020212211 is an apocalyptic number.
111000020212211 is a deficient number, since it is larger than the sum of its proper divisors (9722012434333).
111000020212211 is a wasteful number, since it uses less digits than its factorization.
111000020212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84539238661.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111000020212211 its reverse (112212020000111), we get a palindrome (223212040212322).
The spelling of 111000020212211 in words is "one hundred eleven trillion, twenty million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •