Base | Representation |
---|---|
bin | 101110100111110111… |
… | …1111101010111110101 |
3 | 100120102200121202121011 |
4 | 1131033233331113311 |
5 | 3120022242020041 |
6 | 113555010352221 |
7 | 10143056554045 |
oct | 1351757752765 |
9 | 316380552534 |
10 | 100122220021 |
11 | 3950942388a |
12 | 174a288b671 |
13 | 9597c32c95 |
14 | 4bbb397725 |
15 | 290ed2ce81 |
hex | 174fbfd5f5 |
100122220021 has 4 divisors (see below), whose sum is σ = 100169650944. Its totient is φ = 100074789100.
The previous prime is 100122219971. The next prime is 100122220027. The reversal of 100122220021 is 120022221001.
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 100122220021 - 229 = 99585349109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100122219983 and 100122220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100122220027) 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, 23712295 + ... + 23716516.
It is an arithmetic number, because the mean of its divisors is an integer number (25042412736).
Almost surely, 2100122220021 is an apocalyptic number.
It is an amenable number.
100122220021 is a deficient number, since it is larger than the sum of its proper divisors (47430923).
100122220021 is an equidigital number, since it uses as much as digits as its factorization.
100122220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47430922.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100122220021 its reverse (120022221001), we get a palindrome (220144441022).
The spelling of 100122220021 in words is "one hundred billion, one hundred twenty-two million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •