Base | Representation |
---|---|
bin | 1001010001111001100001… |
… | …0010001001001100101101 |
3 | 1100010101222201220002122121 |
4 | 2110132120102021030231 |
5 | 2314131423132033401 |
6 | 33411123534312541 |
7 | 2102102245626556 |
oct | 224363022111455 |
9 | 40111881802577 |
10 | 10203102221101 |
11 | 3284125233909 |
12 | 118951a358751 |
13 | 5901c109c68a |
14 | 273b9322532d |
15 | 12a6158edca1 |
hex | 9479848932d |
10203102221101 has 2 divisors, whose sum is σ = 10203102221102. Its totient is φ = 10203102221100.
The previous prime is 10203102221087. The next prime is 10203102221161. The reversal of 10203102221101 is 10112220130201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8246603456100 + 1956498765001 = 2871690^2 + 1398749^2 .
It is a cyclic number.
It is not a de Polignac number, because 10203102221101 - 25 = 10203102221069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10203102221161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101551110550 + 5101551110551.
It is an arithmetic number, because the mean of its divisors is an integer number (5101551110551).
Almost surely, 210203102221101 is an apocalyptic number.
It is an amenable number.
10203102221101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10203102221101 is an equidigital number, since it uses as much as digits as its factorization.
10203102221101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10203102221101 its reverse (10112220130201), we get a palindrome (20315322351302).
The spelling of 10203102221101 in words is "ten trillion, two hundred three billion, one hundred two million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •