Base | Representation |
---|---|
bin | 1010001100100000100010… |
… | …1110011000111011011101 |
3 | 1110200122222221102220221011 |
4 | 2203020020232120323131 |
5 | 2432131100310133041 |
6 | 35501450304335221 |
7 | 2234616344333461 |
oct | 243101056307335 |
9 | 43618887386834 |
10 | 11210011021021 |
11 | 3632158a823aa |
12 | 13106aa014511 |
13 | 63413a7bbbb7 |
14 | 2aa7d30484a1 |
15 | 1468e8966e81 |
hex | a3208b98edd |
11210011021021 has 2 divisors, whose sum is σ = 11210011021022. Its totient is φ = 11210011021020.
The previous prime is 11210011020973. The next prime is 11210011021063. The reversal of 11210011021021 is 12012011001211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8005159176921 + 3204851844100 = 2829339^2 + 1790210^2 .
It is a cyclic number.
It is not a de Polignac number, because 11210011021021 - 237 = 11072572067549 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11210011020992 and 11210011021010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11210011025021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605005510510 + 5605005510511.
It is an arithmetic number, because the mean of its divisors is an integer number (5605005510511).
Almost surely, 211210011021021 is an apocalyptic number.
It is an amenable number.
11210011021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11210011021021 is an equidigital number, since it uses as much as digits as its factorization.
11210011021021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11210011021021 its reverse (12012011001211), we get a palindrome (23222022022232).
The spelling of 11210011021021 in words is "eleven trillion, two hundred ten billion, eleven million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •