Base | Representation |
---|---|
bin | 111000110110111001… |
… | …0011011111000001101 |
3 | 102200011102121121011021 |
4 | 1301231302123320031 |
5 | 4000030330202341 |
6 | 132031544354141 |
7 | 11551530364423 |
oct | 1615562337015 |
9 | 380142547137 |
10 | 122101022221 |
11 | 47867931222 |
12 | 1b7b7475951 |
13 | b68b572599 |
14 | 5ca43bb113 |
15 | 32996709d1 |
hex | 1c6dc9be0d |
122101022221 has 4 divisors (see below), whose sum is σ = 122103543744. Its totient is φ = 122098500700.
The previous prime is 122101022179. The next prime is 122101022227. The reversal of 122101022221 is 122220101221.
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 122101022221 - 29 = 122101021709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122101022195 and 122101022204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122101022227) 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, 1186675 + ... + 1285456.
It is an arithmetic number, because the mean of its divisors is an integer number (30525885936).
Almost surely, 2122101022221 is an apocalyptic number.
It is an amenable number.
122101022221 is a deficient number, since it is larger than the sum of its proper divisors (2521523).
122101022221 is an equidigital number, since it uses as much as digits as its factorization.
122101022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2521522.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 122101022221 its reverse (122220101221), we get a palindrome (244321123442).
The spelling of 122101022221 in words is "one hundred twenty-two billion, one hundred one million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •