Base | Representation |
---|---|
bin | 1010000000011010011001… |
… | …0010111010101111011111 |
3 | 1102221210121022122100101021 |
4 | 2200012212102322233133 |
5 | 2420230002003101421 |
6 | 35222201431225011 |
7 | 2213611542232441 |
oct | 240064622725737 |
9 | 42853538570337 |
10 | 11002201222111 |
11 | 3562009843740 |
12 | 1298372b18167 |
13 | 61a670492a48 |
14 | 2a071ba50491 |
15 | 1412d4a68341 |
hex | a01a64babdf |
11002201222111 has 32 divisors (see below), whose sum is σ = 13038328731456. Its totient is φ = 9169978368000.
The previous prime is 11002201222097. The next prime is 11002201222127. The reversal of 11002201222111 is 11122210220011.
It is a cyclic number.
It is not a de Polignac number, because 11002201222111 - 27 = 11002201221983 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 (11002201228111) 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 31 ways as a sum of consecutive naturals, for example, 3907771 + ... + 6105331.
It is an arithmetic number, because the mean of its divisors is an integer number (407447772858).
Almost surely, 211002201222111 is an apocalyptic number.
11002201222111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11002201222111 is a deficient number, since it is larger than the sum of its proper divisors (2036127509345).
11002201222111 is a wasteful number, since it uses less digits than its factorization.
11002201222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2198283.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11002201222111 its reverse (11122210220011), we get a palindrome (22124411442122).
The spelling of 11002201222111 in words is "eleven trillion, two billion, two hundred one million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •