Base | Representation |
---|---|
bin | 1010001100000011001001… |
… | …1001010011111011100001 |
3 | 1110122220122000110212220221 |
4 | 2203000302121103323201 |
5 | 2432013420233012001 |
6 | 35454103305003041 |
7 | 2234216660443156 |
oct | 243006231237341 |
9 | 43586560425827 |
10 | 11202120204001 |
11 | 36298798a8821 |
12 | 130b067483481 |
13 | 633480a862bc |
14 | 2aa28508222d |
15 | 1465d5d371a1 |
hex | a3032653ee1 |
11202120204001 has 2 divisors, whose sum is σ = 11202120204002. Its totient is φ = 11202120204000.
The previous prime is 11202120203987. The next prime is 11202120204017. The reversal of 11202120204001 is 10040202120211.
It is an a-pointer prime, because the next prime (11202120204017) can be obtained adding 11202120204001 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5983522623376 + 5218597580625 = 2446124^2 + 2284425^2 .
It is a cyclic number.
It is not a de Polignac number, because 11202120204001 - 25 = 11202120203969 is a prime.
It is not a weakly prime, because it can be changed into another prime (11202120204071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601060102000 + 5601060102001.
It is an arithmetic number, because the mean of its divisors is an integer number (5601060102001).
Almost surely, 211202120204001 is an apocalyptic number.
It is an amenable number.
11202120204001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202120204001 is an equidigital number, since it uses as much as digits as its factorization.
11202120204001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11202120204001 its reverse (10040202120211), we get a palindrome (21242322324212).
The spelling of 11202120204001 in words is "eleven trillion, two hundred two billion, one hundred twenty million, two hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •