Base | Representation |
---|---|
bin | 1001101001100101100010… |
… | …00111111110111000000101 |
3 | 2210010121210221212122110120 |
4 | 10310302301013332320011 |
5 | 10240132241141231041 |
6 | 113044214540012153 |
7 | 4320050052536655 |
oct | 464626107767005 |
9 | 83117727778416 |
10 | 21220110102021 |
11 | 6841441a44456 |
12 | 2468723b31059 |
13 | bac081015c9c |
14 | 5350b752c365 |
15 | 26beb52da366 |
hex | 134cb11fee05 |
21220110102021 has 8 divisors (see below), whose sum is σ = 28293843105984. Its totient is φ = 14146558583040.
The previous prime is 21220110101989. The next prime is 21220110102029. The reversal of 21220110102021 is 12020101102212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21220110102021 - 25 = 21220110101989 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21220110102029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45098185 + ... + 45566286.
It is an arithmetic number, because the mean of its divisors is an integer number (3536730388248).
Almost surely, 221220110102021 is an apocalyptic number.
It is an amenable number.
21220110102021 is a deficient number, since it is larger than the sum of its proper divisors (7073733003963).
21220110102021 is an equidigital number, since it uses as much as digits as its factorization.
21220110102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90742491.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 21220110102021 its reverse (12020101102212), we get a palindrome (33240211204233).
The spelling of 21220110102021 in words is "twenty-one trillion, two hundred twenty billion, one hundred ten million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •