Base | Representation |
---|---|
bin | 111000110111001101… |
… | …0111000000011111101 |
3 | 102200012011120012021022 |
4 | 1301232122320003331 |
5 | 4000041033422141 |
6 | 132033003513525 |
7 | 11552016446624 |
oct | 1615632700375 |
9 | 380164505238 |
10 | 122111623421 |
11 | 47872912047 |
12 | 1b7bab288a5 |
13 | b690814998 |
14 | 5ca597a6bb |
15 | 329a566b4b |
hex | 1c6e6b80fd |
122111623421 has 2 divisors, whose sum is σ = 122111623422. Its totient is φ = 122111623420.
The previous prime is 122111623411. The next prime is 122111623423. The reversal of 122111623421 is 124326111221.
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., 121528932100 + 582691321 = 348610^2 + 24139^2 .
It is a cyclic number.
It is not a de Polignac number, because 122111623421 - 210 = 122111622397 is a prime.
It is a super-2 number, since 2×1221116234212 (a number of 23 digits) contains 22 as substring.
Together with 122111623423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122111623423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61055811710 + 61055811711.
It is an arithmetic number, because the mean of its divisors is an integer number (61055811711).
Almost surely, 2122111623421 is an apocalyptic number.
It is an amenable number.
122111623421 is a deficient number, since it is larger than the sum of its proper divisors (1).
122111623421 is an equidigital number, since it uses as much as digits as its factorization.
122111623421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 26.
Adding to 122111623421 its reverse (124326111221), we get a palindrome (246437734642).
The spelling of 122111623421 in words is "one hundred twenty-two billion, one hundred eleven million, six hundred twenty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •