Base | Representation |
---|---|
bin | 111000110110111011… |
… | …1000000110101111001 |
3 | 102200011111212120012222 |
4 | 1301231313000311321 |
5 | 4000031132102301 |
6 | 132032030213425 |
7 | 11551543523051 |
oct | 1615567006571 |
9 | 380144776188 |
10 | 122102222201 |
11 | 47868580843 |
12 | 1b7b7954275 |
13 | b68b8a282b |
14 | 5ca4610561 |
15 | 329980b31b |
hex | 1c6ddc0d79 |
122102222201 has 4 divisors (see below), whose sum is σ = 122613110400. Its totient is φ = 121591334004.
The previous prime is 122102222173. The next prime is 122102222273. The reversal of 122102222201 is 102222201221.
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 122102222201 - 226 = 122035113337 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122102222201.
It is not an unprimeable number, because it can be changed into a prime (122102212201) 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, 255443741 + ... + 255444218.
It is an arithmetic number, because the mean of its divisors is an integer number (30653277600).
Almost surely, 2122102222201 is an apocalyptic number.
It is an amenable number.
122102222201 is a deficient number, since it is larger than the sum of its proper divisors (510888199).
122102222201 is an equidigital number, since it uses as much as digits as its factorization.
122102222201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510888198.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 122102222201 its reverse (102222201221), we get a palindrome (224324423422).
The spelling of 122102222201 in words is "one hundred twenty-two billion, one hundred two million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •