Base | Representation |
---|---|
bin | 10001011111011110000… |
… | …010001110100000000101 |
3 | 11020220121220120121110112 |
4 | 101133132002032200011 |
5 | 124143214334014341 |
6 | 2320111213402405 |
7 | 152562125633615 |
oct | 21373602164005 |
9 | 4226556517415 |
10 | 1202021001221 |
11 | 423857578237 |
12 | 174b62499405 |
13 | 89472206111 |
14 | 4226cacca45 |
15 | 2140234aaeb |
hex | 117de08e805 |
1202021001221 has 2 divisors, whose sum is σ = 1202021001222. Its totient is φ = 1202021001220.
The previous prime is 1202021001179. The next prime is 1202021001227. The reversal of 1202021001221 is 1221001202021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1012007832196 + 190013169025 = 1005986^2 + 435905^2 .
It is a cyclic number.
It is not a de Polignac number, because 1202021001221 - 210 = 1202021000197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1202021001196 and 1202021001205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1202021001227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601010500610 + 601010500611.
It is an arithmetic number, because the mean of its divisors is an integer number (601010500611).
Almost surely, 21202021001221 is an apocalyptic number.
It is an amenable number.
1202021001221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202021001221 is an equidigital number, since it uses as much as digits as its factorization.
1202021001221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1202021001221 its reverse (1221001202021), we get a palindrome (2423022203242).
The spelling of 1202021001221 in words is "one trillion, two hundred two billion, twenty-one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •