Base | Representation |
---|---|
bin | 11011101111100111111111… |
… | …011011000111100111000001 |
3 | 121000000222222101020202000221 |
4 | 123233213333123013213001 |
5 | 111443133440332224301 |
6 | 1111303115211343041 |
7 | 34462440425161645 |
oct | 3357477733074701 |
9 | 530028871222027 |
10 | 122020011211201 |
11 | 3597443a301174 |
12 | 11828366a51a81 |
13 | 531158c7928cc |
14 | 221bb2b4c2c25 |
15 | e19049365da1 |
hex | 6ef9ff6c79c1 |
122020011211201 has 2 divisors, whose sum is σ = 122020011211202. Its totient is φ = 122020011211200.
The previous prime is 122020011211193. The next prime is 122020011211207. The reversal of 122020011211201 is 102112110020221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121897056490000 + 122954721201 = 11040700^2 + 350649^2 .
It is a cyclic number.
It is not a de Polignac number, because 122020011211201 - 23 = 122020011211193 is a prime.
It is not a weakly prime, because it can be changed into another prime (122020011211207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61010005605600 + 61010005605601.
It is an arithmetic number, because the mean of its divisors is an integer number (61010005605601).
Almost surely, 2122020011211201 is an apocalyptic number.
It is an amenable number.
122020011211201 is a deficient number, since it is larger than the sum of its proper divisors (1).
122020011211201 is an equidigital number, since it uses as much as digits as its factorization.
122020011211201 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 122020011211201 its reverse (102112110020221), we get a palindrome (224132121231422).
The spelling of 122020011211201 in words is "one hundred twenty-two trillion, twenty billion, eleven million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •