Base | Representation |
---|---|
bin | 111000111001110110… |
… | …0011101101100111001 |
3 | 102200102100002021220212 |
4 | 1301303230131230321 |
5 | 4000231212320441 |
6 | 132045444400505 |
7 | 11554142611532 |
oct | 1616354355471 |
9 | 380370067825 |
10 | 122200120121 |
11 | 47908866a12 |
12 | 1b8246a6135 |
13 | b6a5c5b5b1 |
14 | 5cb3615689 |
15 | 32a31e7eeb |
hex | 1c73b1db39 |
122200120121 has 4 divisors (see below), whose sum is σ = 122207071872. Its totient is φ = 122193168372.
The previous prime is 122200120033. The next prime is 122200120139. The reversal of 122200120121 is 121021002221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 122200120121 - 218 = 122199857977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 122200120096 and 122200120105.
It is not an unprimeable number, because it can be changed into a prime (122200120181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3449441 + ... + 3484686.
It is an arithmetic number, because the mean of its divisors is an integer number (30551767968).
Almost surely, 2122200120121 is an apocalyptic number.
It is an amenable number.
122200120121 is a deficient number, since it is larger than the sum of its proper divisors (6951751).
122200120121 is an equidigital number, since it uses as much as digits as its factorization.
122200120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6951750.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122200120121 its reverse (121021002221), we get a palindrome (243221122342).
The spelling of 122200120121 in words is "one hundred twenty-two billion, two hundred million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •