Base | Representation |
---|---|
bin | 111000111010001001… |
… | …0111111111111010001 |
3 | 102200110001002112010202 |
4 | 1301310102333333101 |
5 | 4000241304101113 |
6 | 132050445104545 |
7 | 11554324514264 |
oct | 1616422777721 |
9 | 380401075122 |
10 | 122210222033 |
11 | 479135366a9 |
12 | 1b827b58155 |
13 | b6a8087663 |
14 | 5cb4ac4cdb |
15 | 32a4041258 |
hex | 1c744bffd1 |
122210222033 has 2 divisors, whose sum is σ = 122210222034. Its totient is φ = 122210222032.
The previous prime is 122210222003. The next prime is 122210222039. The reversal of 122210222033 is 330222012221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70085679169 + 52124542864 = 264737^2 + 228308^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122210222033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122210221996 and 122210222014.
It is not a weakly prime, because it can be changed into another prime (122210222039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61105111016 + 61105111017.
It is an arithmetic number, because the mean of its divisors is an integer number (61105111017).
Almost surely, 2122210222033 is an apocalyptic number.
It is an amenable number.
122210222033 is a deficient number, since it is larger than the sum of its proper divisors (1).
122210222033 is an equidigital number, since it uses as much as digits as its factorization.
122210222033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 122210222033 its reverse (330222012221), we get a palindrome (452432234254).
The spelling of 122210222033 in words is "one hundred twenty-two billion, two hundred ten million, two hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •