Base | Representation |
---|---|
bin | 11011101111011111110011… |
… | …011011010110110001010001 |
3 | 121000000011021201001120000201 |
4 | 123233133303123112301101 |
5 | 111443012434310341423 |
6 | 1111255103005415201 |
7 | 34462006526211625 |
oct | 3357376333266121 |
9 | 530004251046021 |
10 | 122011220012113 |
11 | 35970738964183 |
12 | 1182671286a501 |
13 | 53107bb35b763 |
14 | 221b535b01185 |
15 | e18bd26812ad |
hex | 6ef7f36d6c51 |
122011220012113 has 4 divisors (see below), whose sum is σ = 122059199259648. Its totient is φ = 121963240764580.
The previous prime is 122011220012021. The next prime is 122011220012131. The reversal of 122011220012113 is 311210022110221.
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 122011220012113 - 29 = 122011220011601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122011220018113) 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, 23989619953 + ... + 23989625038.
It is an arithmetic number, because the mean of its divisors is an integer number (30514799814912).
Almost surely, 2122011220012113 is an apocalyptic number.
It is an amenable number.
122011220012113 is a deficient number, since it is larger than the sum of its proper divisors (47979247535).
122011220012113 is an equidigital number, since it uses as much as digits as its factorization.
122011220012113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47979247534.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 122011220012113 its reverse (311210022110221), we get a palindrome (433221242122334).
The spelling of 122011220012113 in words is "one hundred twenty-two trillion, eleven billion, two hundred twenty million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •