Base | Representation |
---|---|
bin | 1010001000011111100101… |
… | …0001001100110001111111 |
3 | 1110110001221200200111001121 |
4 | 2202013321101030301333 |
5 | 2430013313222442421 |
6 | 35410041453451411 |
7 | 2226625110325453 |
oct | 242077121146177 |
9 | 43401850614047 |
10 | 11141032234111 |
11 | 360598128289a |
12 | 12bb2591a0b67 |
13 | 62a796acb060 |
14 | 2a732bd02663 |
15 | 144c0cd27d41 |
hex | a21f944cc7f |
11141032234111 has 4 divisors (see below), whose sum is σ = 11998034713672. Its totient is φ = 10284029754552.
The previous prime is 11141032234097. The next prime is 11141032234121. The reversal of 11141032234111 is 11143223014111.
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 11141032234111 - 219 = 11141031709823 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11141032234121) 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, 428501239761 + ... + 428501239786.
It is an arithmetic number, because the mean of its divisors is an integer number (2999508678418).
Almost surely, 211141032234111 is an apocalyptic number.
11141032234111 is a deficient number, since it is larger than the sum of its proper divisors (857002479561).
11141032234111 is an equidigital number, since it uses as much as digits as its factorization.
11141032234111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857002479560.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 11141032234111 its reverse (11143223014111), we get a palindrome (22284255248222).
The spelling of 11141032234111 in words is "eleven trillion, one hundred forty-one billion, thirty-two million, two hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •