Base | Representation |
---|---|
bin | 11011110000110100101001… |
… | …000000110010011001001101 |
3 | 121000022212102011012120200111 |
4 | 123300310221000302121031 |
5 | 112001011014203032003 |
6 | 1111405010043400021 |
7 | 34501413102511624 |
oct | 3360645100623115 |
9 | 530285364176614 |
10 | 122102313330253 |
11 | 359a6333746383 |
12 | 118402b5823011 |
13 | 5319277832239 |
14 | 2221ad7cbc6bb |
15 | e1b2649c3e6d |
hex | 6f0d2903264d |
122102313330253 has 2 divisors, whose sum is σ = 122102313330254. Its totient is φ = 122102313330252.
The previous prime is 122102313330203. The next prime is 122102313330299. The reversal of 122102313330253 is 352033313201221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115496246498724 + 6606066831529 = 10746918^2 + 2570227^2 .
It is a cyclic number.
It is not a de Polignac number, because 122102313330253 - 221 = 122102311233101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122102313330203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61051156665126 + 61051156665127.
It is an arithmetic number, because the mean of its divisors is an integer number (61051156665127).
Almost surely, 2122102313330253 is an apocalyptic number.
It is an amenable number.
122102313330253 is a deficient number, since it is larger than the sum of its proper divisors (1).
122102313330253 is an equidigital number, since it uses as much as digits as its factorization.
122102313330253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 122102313330253 its reverse (352033313201221), we get a palindrome (474135626531474).
The spelling of 122102313330253 in words is "one hundred twenty-two trillion, one hundred two billion, three hundred thirteen million, three hundred thirty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •