Base | Representation |
---|---|
bin | 11001010001010110111011… |
… | …111100111110001000010111 |
3 | 112120112021010222211221111220 |
4 | 121101112323330332020113 |
5 | 104031440424120303421 |
6 | 1032214505302301423 |
7 | 32260614322441353 |
oct | 3121267374761027 |
9 | 476467128757456 |
10 | 111144022041111 |
11 | 32460a07a18244 |
12 | 10570558127873 |
13 | 4a02ab4499b67 |
14 | 1d63583c26463 |
15 | ccb19ed263c6 |
hex | 6515bbf3e217 |
111144022041111 has 4 divisors (see below), whose sum is σ = 148192029388152. Its totient is φ = 74096014694072.
The previous prime is 111144022041067. The next prime is 111144022041127. The reversal of 111144022041111 is 111140220441111.
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 111144022041111 - 27 = 111144022040983 is a prime.
It is a super-2 number, since 2×1111440220411112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111144022041511) 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, 18524003673516 + ... + 18524003673521.
It is an arithmetic number, because the mean of its divisors is an integer number (37048007347038).
Almost surely, 2111144022041111 is an apocalyptic number.
111144022041111 is a deficient number, since it is larger than the sum of its proper divisors (37048007347041).
111144022041111 is an equidigital number, since it uses as much as digits as its factorization.
111144022041111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37048007347040.
The product of its (nonzero) digits is 256, while the sum is 24.
Adding to 111144022041111 its reverse (111140220441111), we get a palindrome (222284242482222).
The spelling of 111144022041111 in words is "one hundred eleven trillion, one hundred forty-four billion, twenty-two million, forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •