Base | Representation |
---|---|
bin | 1001010010111000110111… |
… | …01100110101100000110101 |
3 | 2200101001202122221211011110 |
4 | 10221130123230311200311 |
5 | 10134343024302200041 |
6 | 111250034342025233 |
7 | 4206520363105002 |
oct | 451343354654065 |
9 | 80331678854143 |
10 | 20440214100021 |
11 | 6570711a90a41 |
12 | 236154a418219 |
13 | b53672157721 |
14 | 5094512008a9 |
15 | 256a6be58516 |
hex | 12971bb35835 |
20440214100021 has 8 divisors (see below), whose sum is σ = 27626956044160. Its totient is φ = 13440140777952.
The previous prime is 20440214100011. The next prime is 20440214100023. The reversal of 20440214100021 is 12000141204402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20440214100021 - 211 = 20440214097973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20440214100023) 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, 46667155261 + ... + 46667155698.
It is an arithmetic number, because the mean of its divisors is an integer number (3453369505520).
Almost surely, 220440214100021 is an apocalyptic number.
It is an amenable number.
20440214100021 is a deficient number, since it is larger than the sum of its proper divisors (7186741944139).
20440214100021 is an equidigital number, since it uses as much as digits as its factorization.
20440214100021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93334311035.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 20440214100021 its reverse (12000141204402), we get a palindrome (32440355304423).
The spelling of 20440214100021 in words is "twenty trillion, four hundred forty billion, two hundred fourteen million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •