Base | Representation |
---|---|
bin | 11011110001000101001110… |
… | …011000001110010010100001 |
3 | 121000101120101010210012122011 |
4 | 123301011032120032102201 |
5 | 112001304001221200001 |
6 | 1111421113024312521 |
7 | 34502613263533342 |
oct | 3361051630162241 |
9 | 530346333705564 |
10 | 122120120100001 |
11 | 35a0294114a011 |
12 | 11843845172741 |
13 | 531ab54a0899a |
14 | 2222906baa0c9 |
15 | e1b957e0dd51 |
hex | 6f114e60e4a1 |
122120120100001 has 2 divisors, whose sum is σ = 122120120100002. Its totient is φ = 122120120100000.
The previous prime is 122120120099963. The next prime is 122120120100029. The reversal of 122120120100001 is 100001021021221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95933719019776 + 26186401080225 = 9794576^2 + 5117265^2 .
It is an emirp because it is prime and its reverse (100001021021221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122120120100001 - 239 = 121570364286113 is a prime.
It is not a weakly prime, because it can be changed into another prime (122120120100701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61060060050000 + 61060060050001.
It is an arithmetic number, because the mean of its divisors is an integer number (61060060050001).
Almost surely, 2122120120100001 is an apocalyptic number.
It is an amenable number.
122120120100001 is a deficient number, since it is larger than the sum of its proper divisors (1).
122120120100001 is an equidigital number, since it uses as much as digits as its factorization.
122120120100001 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 122120120100001 its reverse (100001021021221), we get a palindrome (222121141121222).
The spelling of 122120120100001 in words is "one hundred twenty-two trillion, one hundred twenty billion, one hundred twenty million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •