Base | Representation |
---|---|
bin | 11101101100010010101… |
… | …00111000000001111001 |
3 | 10121112100021100202211111 |
4 | 32312021110320001321 |
5 | 113203343031400441 |
6 | 2100402322400321 |
7 | 133464533055511 |
oct | 16661124700171 |
9 | 3545307322744 |
10 | 1020211200121 |
11 | 36373a697773 |
12 | 1458828000a1 |
13 | 7528964c659 |
14 | 375427c8841 |
15 | 1b810d00081 |
hex | ed89538079 |
1020211200121 has 2 divisors, whose sum is σ = 1020211200122. Its totient is φ = 1020211200120.
The previous prime is 1020211200067. The next prime is 1020211200133. The reversal of 1020211200121 is 1210021120201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 532113350521 + 488097849600 = 729461^2 + 698640^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020211200121 - 229 = 1019674329209 is a prime.
It is a super-2 number, since 2×10202112001212 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1020211200161) 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, 510105600060 + 510105600061.
It is an arithmetic number, because the mean of its divisors is an integer number (510105600061).
Almost surely, 21020211200121 is an apocalyptic number.
It is an amenable number.
1020211200121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020211200121 is an equidigital number, since it uses as much as digits as its factorization.
1020211200121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1020211200121 its reverse (1210021120201), we get a palindrome (2230232320322).
The spelling of 1020211200121 in words is "one trillion, twenty billion, two hundred eleven million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •