Base | Representation |
---|---|
bin | 111000110111001100… |
… | …0100010110101101010 |
3 | 102200012010102010211120 |
4 | 1301232120202311222 |
5 | 4000040404342302 |
6 | 132032542440110 |
7 | 11552011322634 |
oct | 1615630426552 |
9 | 380163363746 |
10 | 122111012202 |
11 | 47872534903 |
12 | 1b7ba893036 |
13 | b69065c70a |
14 | 5ca585ba54 |
15 | 329a4959bc |
hex | 1c6e622d6a |
122111012202 has 8 divisors (see below), whose sum is σ = 244222024416. Its totient is φ = 40703670732.
The previous prime is 122111012197. The next prime is 122111012203. The reversal of 122111012202 is 202210111221.
It is a sphenic number, since it is the product of 3 distinct primes.
122111012202 is an admirable number.
It is a super-2 number, since 2×1221110122022 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122111012203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10175917678 + ... + 10175917689.
It is an arithmetic number, because the mean of its divisors is an integer number (30527753052).
Almost surely, 2122111012202 is an apocalyptic number.
122111012202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122111012202 is a wasteful number, since it uses less digits than its factorization.
122111012202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20351835372.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122111012202 its reverse (202210111221), we get a palindrome (324321123423).
The spelling of 122111012202 in words is "one hundred twenty-two billion, one hundred eleven million, twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •