Base | Representation |
---|---|
bin | 1001010010111100100111… |
… | …0101000000011101100001 |
3 | 1100012010110221221101001211 |
4 | 2110233021311000131201 |
5 | 2314430320002004441 |
6 | 33423303054430121 |
7 | 2103310500450124 |
oct | 224571165003541 |
9 | 40163427841054 |
10 | 10221113313121 |
11 | 3290828001927 |
12 | 1190b06202341 |
13 | 591b016b4889 |
14 | 2749c12dc3bb |
15 | 12ad1bc48a81 |
hex | 94bc9d40761 |
10221113313121 has 2 divisors, whose sum is σ = 10221113313122. Its totient is φ = 10221113313120.
The previous prime is 10221113313053. The next prime is 10221113313137. The reversal of 10221113313121 is 12131331112201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10157893251025 + 63220062096 = 3187145^2 + 251436^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221113313121 - 215 = 10221113280353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221113313092 and 10221113313101.
It is not a weakly prime, because it can be changed into another prime (10221113313721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110556656560 + 5110556656561.
It is an arithmetic number, because the mean of its divisors is an integer number (5110556656561).
Almost surely, 210221113313121 is an apocalyptic number.
It is an amenable number.
10221113313121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221113313121 is an equidigital number, since it uses as much as digits as its factorization.
10221113313121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 10221113313121 its reverse (12131331112201), we get a palindrome (22352444425322).
The spelling of 10221113313121 in words is "ten trillion, two hundred twenty-one billion, one hundred thirteen million, three hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •