Base | Representation |
---|---|
bin | 111000110111011101… |
… | …1010010111010100101 |
3 | 102200012202112222011021 |
4 | 1301232323102322211 |
5 | 4000100222401041 |
6 | 132033510011141 |
7 | 11552151624112 |
oct | 1615673227245 |
9 | 380182488137 |
10 | 122120122021 |
11 | 47877697187 |
12 | 1b801946ab1 |
13 | b6924cc041 |
14 | 5ca6b4d909 |
15 | 329b194cd1 |
hex | 1c6eed2ea5 |
122120122021 has 4 divisors (see below), whose sum is σ = 122125748992. Its totient is φ = 122114495052.
The previous prime is 122120122009. The next prime is 122120122027. The reversal of 122120122021 is 120221021221.
It is a happy number.
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 122120122021 - 25 = 122120121989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122120121986 and 122120122004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122120122027) 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, 2780805 + ... + 2824378.
It is an arithmetic number, because the mean of its divisors is an integer number (30531437248).
Almost surely, 2122120122021 is an apocalyptic number.
It is an amenable number.
122120122021 is a deficient number, since it is larger than the sum of its proper divisors (5626971).
122120122021 is an equidigital number, since it uses as much as digits as its factorization.
122120122021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5626970.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 122120122021 its reverse (120221021221), we get a palindrome (242341143242).
The spelling of 122120122021 in words is "one hundred twenty-two billion, one hundred twenty million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •