Base | Representation |
---|---|
bin | 111000111010001011… |
… | …0000000010111100101 |
3 | 102200110002120120001111 |
4 | 1301310112000113211 |
5 | 4000242004310041 |
6 | 132050514025021 |
7 | 11554334305522 |
oct | 1616426002745 |
9 | 380402516044 |
10 | 122211010021 |
11 | 47913a24731 |
12 | 1b828278171 |
13 | b6a82a2219 |
14 | 5cb4c4c149 |
15 | 32a4149981 |
hex | 1c745805e5 |
122211010021 has 2 divisors, whose sum is σ = 122211010022. Its totient is φ = 122211010020.
The previous prime is 122211010013. The next prime is 122211010073. The reversal of 122211010021 is 120010112221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109619925921 + 12591084100 = 331089^2 + 112210^2 .
It is a cyclic number.
It is not a de Polignac number, because 122211010021 - 23 = 122211010013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122211009983 and 122211010010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122211010091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61105505010 + 61105505011.
It is an arithmetic number, because the mean of its divisors is an integer number (61105505011).
Almost surely, 2122211010021 is an apocalyptic number.
It is an amenable number.
122211010021 is a deficient number, since it is larger than the sum of its proper divisors (1).
122211010021 is an equidigital number, since it uses as much as digits as its factorization.
122211010021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 122211010021 its reverse (120010112221), we get a palindrome (242221122242).
The spelling of 122211010021 in words is "one hundred twenty-two billion, two hundred eleven million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •