Base | Representation |
---|---|
bin | 111000110110111011… |
… | …0111011011110011101 |
3 | 102200011111211110001220 |
4 | 1301231312323132131 |
5 | 4000031130401341 |
6 | 132032025523553 |
7 | 11551543402011 |
oct | 1615566733635 |
9 | 380144743056 |
10 | 122102200221 |
11 | 47868566281 |
12 | 1b7b79435b9 |
13 | b68b895821 |
14 | 5ca4606541 |
15 | 3299804a66 |
hex | 1c6ddbb79d |
122102200221 has 4 divisors (see below), whose sum is σ = 162802933632. Its totient is φ = 81401466812.
The previous prime is 122102200219. The next prime is 122102200261. The reversal of 122102200221 is 122002201221.
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 122102200221 - 21 = 122102200219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122102200221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122102200211) 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, 20350366701 + ... + 20350366706.
It is an arithmetic number, because the mean of its divisors is an integer number (40700733408).
Almost surely, 2122102200221 is an apocalyptic number.
It is an amenable number.
122102200221 is a deficient number, since it is larger than the sum of its proper divisors (40700733411).
122102200221 is an equidigital number, since it uses as much as digits as its factorization.
122102200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40700733410.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 122102200221 its reverse (122002201221), we get a palindrome (244104401442).
The spelling of 122102200221 in words is "one hundred twenty-two billion, one hundred two million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •