Base | Representation |
---|---|
bin | 111000110110111011… |
… | …0111101110111100101 |
3 | 102200011111211221111212 |
4 | 1301231312331313211 |
5 | 4000031131210041 |
6 | 132032030041205 |
7 | 11551543442411 |
oct | 1615566756745 |
9 | 380144757455 |
10 | 122102210021 |
11 | 47868572680 |
12 | 1b7b7949205 |
13 | b68b89a11c |
14 | 5ca4609d41 |
15 | 32998078eb |
hex | 1c6ddbdde5 |
122102210021 has 8 divisors (see below), whose sum is σ = 133243701600. Its totient is φ = 110967600240.
The previous prime is 122102210011. The next prime is 122102210023. The reversal of 122102210021 is 120012201221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122102210021 - 210 = 122102208997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122102209978 and 122102210005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122102210023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1683311 + ... + 1754348.
It is an arithmetic number, because the mean of its divisors is an integer number (16655462700).
Almost surely, 2122102210021 is an apocalyptic number.
122102210021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122102210021 is a deficient number, since it is larger than the sum of its proper divisors (11141491579).
122102210021 is a wasteful number, since it uses less digits than its factorization.
122102210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3440899.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122102210021 its reverse (120012201221), we get a palindrome (242114411242).
The spelling of 122102210021 in words is "one hundred twenty-two billion, one hundred two million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •