Base | Representation |
---|---|
bin | 11011110010011010110100… |
… | …000111001001100011010101 |
3 | 121000201100120212221111001202 |
4 | 123302122310013021203111 |
5 | 112004310204412312042 |
6 | 1111531232200202245 |
7 | 34512345546234503 |
oct | 3362326407114325 |
9 | 530640525844052 |
10 | 122212021213397 |
11 | 35a38910a067a5 |
12 | 11859612769385 |
13 | 532670c66151b |
14 | 2227144381673 |
15 | e1e036118632 |
hex | 6f26b41c98d5 |
122212021213397 has 2 divisors, whose sum is σ = 122212021213398. Its totient is φ = 122212021213396.
The previous prime is 122212021213393. The next prime is 122212021213489. The reversal of 122212021213397 is 793312120212221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85543982502001 + 36668038711396 = 9248999^2 + 6055414^2 .
It is a cyclic number.
It is not a de Polignac number, because 122212021213397 - 22 = 122212021213393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122212021213397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122212021213393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61106010606698 + 61106010606699.
It is an arithmetic number, because the mean of its divisors is an integer number (61106010606699).
Almost surely, 2122212021213397 is an apocalyptic number.
It is an amenable number.
122212021213397 is a deficient number, since it is larger than the sum of its proper divisors (1).
122212021213397 is an equidigital number, since it uses as much as digits as its factorization.
122212021213397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36288, while the sum is 38.
The spelling of 122212021213397 in words is "one hundred twenty-two trillion, two hundred twelve billion, twenty-one million, two hundred thirteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •