Base | Representation |
---|---|
bin | 11011110010011000111011… |
… | …101000110101010000111001 |
3 | 121000201011101000200012121102 |
4 | 123302120323220311100321 |
5 | 112004242040000000212 |
6 | 1111530255434421145 |
7 | 34512244504221314 |
oct | 3362307350652071 |
9 | 530634330605542 |
10 | 122210000000057 |
11 | 35a37a73aa0252 |
12 | 118591498917b5 |
13 | 532647999a6b8 |
14 | 2226dd1b6397b |
15 | e1de689655c2 |
hex | 6f263ba35439 |
122210000000057 has 2 divisors, whose sum is σ = 122210000000058. Its totient is φ = 122210000000056.
The previous prime is 122209999999991. The next prime is 122210000000069. The reversal of 122210000000057 is 750000000012221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85125054552976 + 37084945447081 = 9226324^2 + 6089741^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122210000000057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122209999999966 and 122210000000038.
It is not a weakly prime, because it can be changed into another prime (122210000000087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61105000000028 + 61105000000029.
It is an arithmetic number, because the mean of its divisors is an integer number (61105000000029).
Almost surely, 2122210000000057 is an apocalyptic number.
It is an amenable number.
122210000000057 is a deficient number, since it is larger than the sum of its proper divisors (1).
122210000000057 is an equidigital number, since it uses as much as digits as its factorization.
122210000000057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 280, while the sum is 20.
Adding to 122210000000057 its reverse (750000000012221), we get a palindrome (872210000012278).
The spelling of 122210000000057 in words is "one hundred twenty-two trillion, two hundred ten billion, fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •