Base | Representation |
---|---|
bin | 11101101100010011110… |
… | …10101100011101101101 |
3 | 10121112100222000110102101 |
4 | 32312021322230131231 |
5 | 113203403101123341 |
6 | 2100403315055101 |
7 | 133465013246551 |
oct | 16661172543555 |
9 | 3545328013371 |
10 | 1020221114221 |
11 | 363745249341 |
12 | 145885ba1491 |
13 | 7528b71109a |
14 | 37543c49861 |
15 | 1b811b0c831 |
hex | ed89eac76d |
1020221114221 has 2 divisors, whose sum is σ = 1020221114222. Its totient is φ = 1020221114220.
The previous prime is 1020221114219. The next prime is 1020221114281. The reversal of 1020221114221 is 1224111220201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1018109252196 + 2111862025 = 1009014^2 + 45955^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020221114221 - 21 = 1020221114219 is a prime.
It is a super-2 number, since 2×10202211142212 (a number of 25 digits) contains 22 as substring.
Together with 1020221114219, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020221114281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510110557110 + 510110557111.
It is an arithmetic number, because the mean of its divisors is an integer number (510110557111).
Almost surely, 21020221114221 is an apocalyptic number.
It is an amenable number.
1020221114221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020221114221 is an equidigital number, since it uses as much as digits as its factorization.
1020221114221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 1020221114221 its reverse (1224111220201), we get a palindrome (2244332334422).
The spelling of 1020221114221 in words is "one trillion, twenty billion, two hundred twenty-one million, one hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •