Base | Representation |
---|---|
bin | 10100011111100100… |
… | …00100010001011111 |
3 | 1001101202120201200201 |
4 | 22033302010101133 |
5 | 140013030414213 |
6 | 5015423204331 |
7 | 536434111201 |
oct | 121762042137 |
9 | 31352521621 |
10 | 11002201183 |
11 | 4736501656 |
12 | 21707466a7 |
13 | 106451851c |
14 | 7652c4771 |
15 | 445d766dd |
hex | 28fc8445f |
11002201183 has 2 divisors, whose sum is σ = 11002201184. Its totient is φ = 11002201182.
The previous prime is 11002201181. The next prime is 11002201207. The reversal of 11002201183 is 38110220011.
11002201183 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11002201183 - 21 = 11002201181 is a prime.
Together with 11002201181, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11002201183.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11002201181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501100591 + 5501100592.
It is an arithmetic number, because the mean of its divisors is an integer number (5501100592).
Almost surely, 211002201183 is an apocalyptic number.
11002201183 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002201183 is an equidigital number, since it uses as much as digits as its factorization.
11002201183 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 11002201183 its reverse (38110220011), we get a palindrome (49112421194).
The spelling of 11002201183 in words is "eleven billion, two million, two hundred one thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •