Base | Representation |
---|---|
bin | 1010000000011110001100… |
… | …1010001000111101001011 |
3 | 1102221220020111001001201211 |
4 | 2200013203022020331023 |
5 | 2420234044404044321 |
6 | 35222451025153551 |
7 | 2213646051432055 |
oct | 240074312107513 |
9 | 42856214031654 |
10 | 11003222331211 |
11 | 3562493175060 |
12 | 12985b8a8b8b7 |
13 | 61a7a3bb1106 |
14 | 2a07b74d48d5 |
15 | 1413445190e1 |
hex | a01e3288f4b |
11003222331211 has 32 divisors (see below), whose sum is σ = 12440562494976. Its totient is φ = 9645105120000.
The previous prime is 11003222331197. The next prime is 11003222331251. The reversal of 11003222331211 is 11213322230011.
It is a cyclic number.
It is not a de Polignac number, because 11003222331211 - 211 = 11003222329163 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11003222331251) 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 31 ways as a sum of consecutive naturals, for example, 13005816 + ... + 13825978.
It is an arithmetic number, because the mean of its divisors is an integer number (388767577968).
Almost surely, 211003222331211 is an apocalyptic number.
11003222331211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11003222331211 is a deficient number, since it is larger than the sum of its proper divisors (1437340163765).
11003222331211 is a wasteful number, since it uses less digits than its factorization.
11003222331211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820563.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11003222331211 its reverse (11213322230011), we get a palindrome (22216544561222).
The spelling of 11003222331211 in words is "eleven trillion, three billion, two hundred twenty-two million, three hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •