Base | Representation |
---|---|
bin | 101111000010101100… |
… | …1001100001011011101 |
3 | 100122202102010112212112 |
4 | 1132011121030023131 |
5 | 3123343142033041 |
6 | 114224200443405 |
7 | 10204265465501 |
oct | 1360531141335 |
9 | 318672115775 |
10 | 101022221021 |
11 | 39930456967 |
12 | 176b4179565 |
13 | 96ac529c57 |
14 | 4c64b14301 |
15 | 2963d59deb |
hex | 178564c2dd |
101022221021 has 8 divisors (see below), whose sum is σ = 101559670464. Its totient is φ = 100484916480.
The previous prime is 101022220961. The next prime is 101022221039. The reversal of 101022221021 is 120122220101.
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 101022221021 - 210 = 101022219997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101022220987 and 101022221005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101022221921) 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 7 ways as a sum of consecutive naturals, for example, 1544186 + ... + 1608276.
It is an arithmetic number, because the mean of its divisors is an integer number (12694958808).
Almost surely, 2101022221021 is an apocalyptic number.
It is an amenable number.
101022221021 is a deficient number, since it is larger than the sum of its proper divisors (537449443).
101022221021 is an equidigital number, since it uses as much as digits as its factorization.
101022221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72451.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101022221021 its reverse (120122220101), we get a palindrome (221144441122).
The spelling of 101022221021 in words is "one hundred one billion, twenty-two million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •