Base | Representation |
---|---|
bin | 11011101111010101100011… |
… | …010011111110000011111001 |
3 | 120222222002212112221220001001 |
4 | 123233111203103332003321 |
5 | 111442322413312102301 |
6 | 1111250042422325001 |
7 | 34461136663432645 |
oct | 3357254323760371 |
9 | 528862775856031 |
10 | 122000212222201 |
11 | 35966aaa295745 |
12 | 11824560289761 |
13 | 530c7559374c1 |
14 | 221abadba3c25 |
15 | e1878b0a3c01 |
hex | 6ef5634fe0f9 |
122000212222201 has 2 divisors, whose sum is σ = 122000212222202. Its totient is φ = 122000212222200.
The previous prime is 122000212222171. The next prime is 122000212222219. The reversal of 122000212222201 is 102222212000221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74367080613225 + 47633131608976 = 8623635^2 + 6901676^2 .
It is a cyclic number.
It is not a de Polignac number, because 122000212222201 - 29 = 122000212221689 is a prime.
It is not a weakly prime, because it can be changed into another prime (122000212222241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61000106111100 + 61000106111101.
It is an arithmetic number, because the mean of its divisors is an integer number (61000106111101).
Almost surely, 2122000212222201 is an apocalyptic number.
It is an amenable number.
122000212222201 is a deficient number, since it is larger than the sum of its proper divisors (1).
122000212222201 is an equidigital number, since it uses as much as digits as its factorization.
122000212222201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 122000212222201 its reverse (102222212000221), we get a palindrome (224222424222422).
The spelling of 122000212222201 in words is "one hundred twenty-two trillion, two hundred twelve million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •