Base | Representation |
---|---|
bin | 11001010010010110010001… |
… | …000000110101100011100011 |
3 | 112120202202122222002121022021 |
4 | 121102112101000311203203 |
5 | 104034044204401023021 |
6 | 1032310032554322311 |
7 | 32265542362133512 |
oct | 3122262100654343 |
9 | 476682588077267 |
10 | 111212021111011 |
11 | 32487831697977 |
12 | 10581774a29397 |
13 | 4a093302029b2 |
14 | 1d66994bc0679 |
15 | cccd2e93dc41 |
hex | 6525910358e3 |
111212021111011 has 8 divisors (see below), whose sum is σ = 112543752724704. Its totient is φ = 109884811507200.
The previous prime is 111212021110997. The next prime is 111212021111033. The reversal of 111212021111011 is 110111120212111.
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 111212021111011 - 233 = 111203431176419 is a prime.
It is a super-2 number, since 2×1112120211110112 (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 (111212021111071) 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, 1130452990 + ... + 1130551363.
It is an arithmetic number, because the mean of its divisors is an integer number (14067969090588).
Almost surely, 2111212021111011 is an apocalyptic number.
111212021111011 is a deficient number, since it is larger than the sum of its proper divisors (1331731613693).
111212021111011 is a wasteful number, since it uses less digits than its factorization.
111212021111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2261004941.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 111212021111011 its reverse (110111120212111), we get a palindrome (221323141323122).
The spelling of 111212021111011 in words is "one hundred eleven trillion, two hundred twelve billion, twenty-one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •