Base | Representation |
---|---|
bin | 111000110100000000… |
… | …0100100000000001101 |
3 | 102122220200011112001011 |
4 | 1301220000210000031 |
5 | 3444331014442341 |
6 | 132014202245221 |
7 | 11546242263256 |
oct | 1615000440015 |
9 | 378820145034 |
10 | 122004062221 |
11 | 47818126798 |
12 | 1b78aab6811 |
13 | b6744546c2 |
14 | 5c9557bb2d |
15 | 3290dbbb81 |
hex | 1c6802400d |
122004062221 has 2 divisors, whose sum is σ = 122004062222. Its totient is φ = 122004062220.
The previous prime is 122004062209. The next prime is 122004062273. The reversal of 122004062221 is 122260400221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102951781321 + 19052280900 = 320861^2 + 138030^2 .
It is a cyclic number.
It is not a de Polignac number, because 122004062221 - 235 = 87644323853 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122004062192 and 122004062201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122004062321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61002031110 + 61002031111.
It is an arithmetic number, because the mean of its divisors is an integer number (61002031111).
Almost surely, 2122004062221 is an apocalyptic number.
It is an amenable number.
122004062221 is a deficient number, since it is larger than the sum of its proper divisors (1).
122004062221 is an equidigital number, since it uses as much as digits as its factorization.
122004062221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 122004062221 its reverse (122260400221), we get a palindrome (244264462442).
The spelling of 122004062221 in words is "one hundred twenty-two billion, four million, sixty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •