Base | Representation |
---|---|
bin | 111000110110111001… |
… | …0011001001001001101 |
3 | 102200011102121000210110 |
4 | 1301231302121021031 |
5 | 4000030324323041 |
6 | 132031544230233 |
7 | 11551530316653 |
oct | 1615562311115 |
9 | 380142530713 |
10 | 122101011021 |
11 | 47867923870 |
12 | 1b7b746b379 |
13 | b68b56a462 |
14 | 5ca43b6dd3 |
15 | 329966c516 |
hex | 1c6dc9924d |
122101011021 has 32 divisors (see below), whose sum is σ = 194114727936. Its totient is φ = 67400928000.
The previous prime is 122101011013. The next prime is 122101011049. The reversal of 122101011021 is 120110101221.
It is not a de Polignac number, because 122101011021 - 23 = 122101011013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122101010988 and 122101011006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122101011061) 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 31 ways as a sum of consecutive naturals, for example, 3493075 + ... + 3527856.
It is an arithmetic number, because the mean of its divisors is an integer number (6066085248).
Almost surely, 2122101011021 is an apocalyptic number.
122101011021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122101011021 is a deficient number, since it is larger than the sum of its proper divisors (72013716915).
122101011021 is a wasteful number, since it uses less digits than its factorization.
122101011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7020993.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 122101011021 its reverse (120110101221), we get a palindrome (242211112242).
The spelling of 122101011021 in words is "one hundred twenty-two billion, one hundred one million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •