Base | Representation |
---|---|
bin | 1010000000011001101011… |
… | …1101101111010101001101 |
3 | 1102221210010001221012122101 |
4 | 2200012122331233111031 |
5 | 2420224104321332343 |
6 | 35222130520515101 |
7 | 2213604043343635 |
oct | 240063275572515 |
9 | 42853101835571 |
10 | 11002011120973 |
11 | 3561a21501964 |
12 | 129831b31ba91 |
13 | 61a63cc93272 |
14 | 2a07006c76c5 |
15 | 1412c3016e4d |
hex | a019af6f54d |
11002011120973 has 2 divisors, whose sum is σ = 11002011120974. Its totient is φ = 11002011120972.
The previous prime is 11002011120911. The next prime is 11002011121033. The reversal of 11002011120973 is 37902111020011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10555201761129 + 446809359844 = 3248877^2 + 668438^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11002011120973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11002011123973) 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 as a sum of consecutive naturals, namely, 5501005560486 + 5501005560487.
It is an arithmetic number, because the mean of its divisors is an integer number (5501005560487).
Almost surely, 211002011120973 is an apocalyptic number.
It is an amenable number.
11002011120973 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002011120973 is an equidigital number, since it uses as much as digits as its factorization.
11002011120973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 28.
Adding to 11002011120973 its reverse (37902111020011), we get a palindrome (48904122140984).
The spelling of 11002011120973 in words is "eleven trillion, two billion, eleven million, one hundred twenty thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •