Base | Representation |
---|---|
bin | 111000110111100001… |
… | …0111000010000110001 |
3 | 102200012220021222011011 |
4 | 1301233002320100301 |
5 | 4000101230010001 |
6 | 132034020350521 |
7 | 11552204544013 |
oct | 1615702702061 |
9 | 380186258134 |
10 | 122122110001 |
11 | 47878824841 |
12 | 1b802545441 |
13 | b692a46b68 |
14 | 5ca710a1b3 |
15 | 329b438d51 |
hex | 1c6f0b8431 |
122122110001 has 2 divisors, whose sum is σ = 122122110002. Its totient is φ = 122122110000.
The previous prime is 122122109929. The next prime is 122122110013. The reversal of 122122110001 is 100011221221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62792842225 + 59329267776 = 250585^2 + 243576^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122122110001 is a prime.
It is not a weakly prime, because it can be changed into another prime (122122117001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61061055000 + 61061055001.
It is an arithmetic number, because the mean of its divisors is an integer number (61061055001).
Almost surely, 2122122110001 is an apocalyptic number.
It is an amenable number.
122122110001 is a deficient number, since it is larger than the sum of its proper divisors (1).
122122110001 is an equidigital number, since it uses as much as digits as its factorization.
122122110001 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 122122110001 its reverse (100011221221), we get a palindrome (222133331222).
It can be divided in two parts, 1221221 and 10001, that multiplied together give a palindrome (12213431221).
The spelling of 122122110001 in words is "one hundred twenty-two billion, one hundred twenty-two million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •