Base | Representation |
---|---|
bin | 111000111001111000… |
… | …0101000010001110101 |
3 | 102200102102010202201121 |
4 | 1301303300220101311 |
5 | 4000232002241041 |
6 | 132045524023541 |
7 | 11554155110110 |
oct | 1616360502165 |
9 | 380372122647 |
10 | 122201212021 |
11 | 47909442309 |
12 | 1b824b31bb1 |
13 | b6a62515a5 |
14 | 5cb381b577 |
15 | 32a33617d1 |
hex | 1c73c28475 |
122201212021 has 4 divisors (see below), whose sum is σ = 139658528032. Its totient is φ = 104743896012.
The previous prime is 122201211943. The next prime is 122201212031. The reversal of 122201212021 is 120212102221.
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 not a de Polignac number, because 122201212021 - 215 = 122201179253 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122201211986 and 122201212004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122201212031) 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, 8728657995 + ... + 8728658008.
It is an arithmetic number, because the mean of its divisors is an integer number (34914632008).
Almost surely, 2122201212021 is an apocalyptic number.
It is an amenable number.
122201212021 is a deficient number, since it is larger than the sum of its proper divisors (17457316011).
122201212021 is an equidigital number, since it uses as much as digits as its factorization.
122201212021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17457316010.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 122201212021 its reverse (120212102221), we get a palindrome (242413314242).
The spelling of 122201212021 in words is "one hundred twenty-two billion, two hundred one million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •