Base | Representation |
---|---|
bin | 11011110000111011110011… |
… | …110010000101111010101001 |
3 | 121000100121021120021002202120 |
4 | 123300323303302011322221 |
5 | 112001122300104021301 |
6 | 1111412321514421453 |
7 | 34502104613140203 |
oct | 3360736362057251 |
9 | 530317246232676 |
10 | 122110010220201 |
11 | 359a9623405753 |
12 | 118418a3431889 |
13 | 5319c03328aa3 |
14 | 2222228203773 |
15 | e1b565598e36 |
hex | 6f0ef3c85ea9 |
122110010220201 has 4 divisors (see below), whose sum is σ = 162813346960272. Its totient is φ = 81406673480132.
The previous prime is 122110010220193. The next prime is 122110010220227. The reversal of 122110010220201 is 102022010011221.
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 122110010220201 - 23 = 122110010220193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122110010290201) 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, 20351668370031 + ... + 20351668370036.
It is an arithmetic number, because the mean of its divisors is an integer number (40703336740068).
Almost surely, 2122110010220201 is an apocalyptic number.
It is an amenable number.
122110010220201 is a deficient number, since it is larger than the sum of its proper divisors (40703336740071).
122110010220201 is an equidigital number, since it uses as much as digits as its factorization.
122110010220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40703336740070.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122110010220201 its reverse (102022010011221), we get a palindrome (224132020231422).
The spelling of 122110010220201 in words is "one hundred twenty-two trillion, one hundred ten billion, ten million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •