Base | Representation |
---|---|
bin | 11011110000110100010110… |
… | …010110010111111101000101 |
3 | 121000022211121100001000221022 |
4 | 123300310112112113331011 |
5 | 112001004344024101041 |
6 | 1111404515020400525 |
7 | 34501402251235631 |
oct | 3360642626277505 |
9 | 530284540030838 |
10 | 122102000222021 |
11 | 359a6192a29546 |
12 | 118402289a6145 |
13 | 53192279c4bb1 |
14 | 2221aa8495dc1 |
15 | e1b24727624b |
hex | 6f0d16597f45 |
122102000222021 has 2 divisors, whose sum is σ = 122102000222022. Its totient is φ = 122102000222020.
The previous prime is 122102000221919. The next prime is 122102000222051. The reversal of 122102000222021 is 120222000201221.
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., 113771768968225 + 8330231253796 = 10666385^2 + 2886214^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122102000222021 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122102000222051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61051000111010 + 61051000111011.
It is an arithmetic number, because the mean of its divisors is an integer number (61051000111011).
Almost surely, 2122102000222021 is an apocalyptic number.
It is an amenable number.
122102000222021 is a deficient number, since it is larger than the sum of its proper divisors (1).
122102000222021 is an equidigital number, since it uses as much as digits as its factorization.
122102000222021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 122102000222021 its reverse (120222000201221), we get a palindrome (242324000423242).
The spelling of 122102000222021 in words is "one hundred twenty-two trillion, one hundred two billion, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •