Base | Representation |
---|---|
bin | 111000110111011101… |
… | …1101011010110010101 |
3 | 102200012202202001102221 |
4 | 1301232323223112111 |
5 | 4000100234101401 |
6 | 132033512102341 |
7 | 11552152521643 |
oct | 1615673532625 |
9 | 380182661387 |
10 | 122120222101 |
11 | 47877755399 |
12 | 1b8019949b1 |
13 | b692535767 |
14 | 5ca6b78193 |
15 | 329b1b47a1 |
hex | 1c6eeeb595 |
122120222101 has 2 divisors, whose sum is σ = 122120222102. Its totient is φ = 122120222100.
The previous prime is 122120222099. The next prime is 122120222167. The reversal of 122120222101 is 101222021221.
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., 111005580625 + 11114641476 = 333175^2 + 105426^2 .
It is a cyclic number.
It is not a de Polignac number, because 122120222101 - 21 = 122120222099 is a prime.
Together with 122120222099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122120222201) 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, 61060111050 + 61060111051.
It is an arithmetic number, because the mean of its divisors is an integer number (61060111051).
Almost surely, 2122120222101 is an apocalyptic number.
It is an amenable number.
122120222101 is a deficient number, since it is larger than the sum of its proper divisors (1).
122120222101 is an equidigital number, since it uses as much as digits as its factorization.
122120222101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 122120222101 its reverse (101222021221), we get a palindrome (223342243322).
The spelling of 122120222101 in words is "one hundred twenty-two billion, one hundred twenty million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •