Base | Representation |
---|---|
bin | 11110100011110011000… |
… | …001001101001010110101 |
3 | 21102202112002102021121111 |
4 | 132203303001031022311 |
5 | 233401320413020041 |
6 | 4244423022515021 |
7 | 304502324563354 |
oct | 36436301151265 |
9 | 7382462367544 |
10 | 2100021220021 |
11 | 73a68325a89a |
12 | 29abb8a35a71 |
13 | 12305359362a |
14 | 738da67599b |
15 | 3995e009981 |
hex | 1e8f304d2b5 |
2100021220021 has 8 divisors (see below), whose sum is σ = 2123630223264. Its totient is φ = 2076543015120.
The previous prime is 2100021219979. The next prime is 2100021220043. The reversal of 2100021220021 is 1200221200012.
It is a happy number.
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 2100021220021 - 219 = 2100020695733 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2100021219983 and 2100021220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100021220091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32667295 + ... + 32731516.
It is an arithmetic number, because the mean of its divisors is an integer number (265453777908).
Almost surely, 22100021220021 is an apocalyptic number.
It is an amenable number.
2100021220021 is a deficient number, since it is larger than the sum of its proper divisors (23609003243).
2100021220021 is a wasteful number, since it uses less digits than its factorization.
2100021220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65399171.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2100021220021 its reverse (1200221200012), we get a palindrome (3300242420033).
The spelling of 2100021220021 in words is "two trillion, one hundred billion, twenty-one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •