Base | Representation |
---|---|
bin | 11011110010011011111100… |
… | …010010011001110010010101 |
3 | 121000201110201021111001210122 |
4 | 123302123330102121302111 |
5 | 112004320144410414104 |
6 | 1111531552254201325 |
7 | 34512420551631335 |
oct | 3362337422316225 |
9 | 530643637431718 |
10 | 122213232123029 |
11 | 35a39382494063 |
12 | 118598b01b3245 |
13 | 53268734a55b8 |
14 | 222721b1110c5 |
15 | e1e0a75ab6be |
hex | 6f26fc499c95 |
122213232123029 has 2 divisors, whose sum is σ = 122213232123030. Its totient is φ = 122213232123028.
The previous prime is 122213232123007. The next prime is 122213232123071. The reversal of 122213232123029 is 920321232312221.
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., 119078880554929 + 3134351568100 = 10912327^2 + 1770410^2 .
It is a cyclic number.
It is not a de Polignac number, because 122213232123029 - 212 = 122213232118933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122213232123029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122213232153029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61106616061514 + 61106616061515.
It is an arithmetic number, because the mean of its divisors is an integer number (61106616061515).
Almost surely, 2122213232123029 is an apocalyptic number.
It is an amenable number.
122213232123029 is a deficient number, since it is larger than the sum of its proper divisors (1).
122213232123029 is an equidigital number, since it uses as much as digits as its factorization.
122213232123029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 35.
The spelling of 122213232123029 in words is "one hundred twenty-two trillion, two hundred thirteen billion, two hundred thirty-two million, one hundred twenty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •