Base | Representation |
---|---|
bin | 1001010010111001001101… |
… | …1101010001010101100001 |
3 | 1100012001010101111012212221 |
4 | 2110232103131101111201 |
5 | 2314421432441333441 |
6 | 33423032351151041 |
7 | 2103246053112205 |
oct | 224562335212541 |
9 | 40161111435787 |
10 | 10220201121121 |
11 | 32903aa102542 |
12 | 11908b0815481 |
13 | 5919b770c9b4 |
14 | 2749360cab05 |
15 | 12acb6b0e8d1 |
hex | 94b93751561 |
10220201121121 has 2 divisors, whose sum is σ = 10220201121122. Its totient is φ = 10220201121120.
The previous prime is 10220201121103. The next prime is 10220201121133. The reversal of 10220201121121 is 12112110202201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9582336936225 + 637864184896 = 3095535^2 + 798664^2 .
It is a cyclic number.
It is not a de Polignac number, because 10220201121121 - 223 = 10220192732513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10220201121095 and 10220201121104.
It is not a weakly prime, because it can be changed into another prime (10220201121191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110100560560 + 5110100560561.
It is an arithmetic number, because the mean of its divisors is an integer number (5110100560561).
Almost surely, 210220201121121 is an apocalyptic number.
It is an amenable number.
10220201121121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220201121121 is an equidigital number, since it uses as much as digits as its factorization.
10220201121121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10220201121121 its reverse (12112110202201), we get a palindrome (22332311323322).
The spelling of 10220201121121 in words is "ten trillion, two hundred twenty billion, two hundred one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •