Base | Representation |
---|---|
bin | 1010000001100100101001… |
… | …0100101101001001001111 |
3 | 1110000201001101211202110112 |
4 | 2200121022110231021033 |
5 | 2421041312023221221 |
6 | 35235255323030235 |
7 | 2215215505604144 |
oct | 240311224551117 |
9 | 43021041752415 |
10 | 11022133023311 |
11 | 356a507821a13 |
12 | 12a01b606b37b |
13 | 61c4c89ac957 |
14 | 2a168cc623cb |
15 | 141a9e81215b |
hex | a064a52d24f |
11022133023311 has 4 divisors (see below), whose sum is σ = 11173121146992. Its totient is φ = 10871144899632.
The previous prime is 11022133023287. The next prime is 11022133023313. The reversal of 11022133023311 is 11332033122011.
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 11022133023311 - 230 = 11021059281487 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 (11022133023313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75494061731 + ... + 75494061876.
It is an arithmetic number, because the mean of its divisors is an integer number (2793280286748).
Almost surely, 211022133023311 is an apocalyptic number.
11022133023311 is a deficient number, since it is larger than the sum of its proper divisors (150988123681).
11022133023311 is an equidigital number, since it uses as much as digits as its factorization.
11022133023311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150988123680.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11022133023311 its reverse (11332033122011), we get a palindrome (22354166145322).
The spelling of 11022133023311 in words is "eleven trillion, twenty-two billion, one hundred thirty-three million, twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •