Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …0010110101111101000101 |
3 | 1100010012211220101100222202 |
4 | 2110130201202311331011 |
5 | 2314113333142010041 |
6 | 33410154132404245 |
7 | 2102002006152545 |
oct | 224344142657505 |
9 | 40105756340882 |
10 | 10201110110021 |
11 | 32832a2795316 |
12 | 1189063176685 |
13 | 58cc6445801c |
14 | 273a44821325 |
15 | 12a54aa98a9b |
hex | 947218b5f45 |
10201110110021 has 2 divisors, whose sum is σ = 10201110110022. Its totient is φ = 10201110110020.
The previous prime is 10201110110003. The next prime is 10201110110041. The reversal of 10201110110021 is 12001101110201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9852762265921 + 348347844100 = 3138911^2 + 590210^2 .
It is a cyclic number.
It is not a de Polignac number, because 10201110110021 - 238 = 9926232203077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10201110109984 and 10201110110011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10201110110041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100555055010 + 5100555055011.
It is an arithmetic number, because the mean of its divisors is an integer number (5100555055011).
Almost surely, 210201110110021 is an apocalyptic number.
It is an amenable number.
10201110110021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201110110021 is an equidigital number, since it uses as much as digits as its factorization.
10201110110021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10201110110021 its reverse (12001101110201), we get a palindrome (22202211220222).
The spelling of 10201110110021 in words is "ten trillion, two hundred one billion, one hundred ten million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •