Base | Representation |
---|---|
bin | 1001001001010101100001… |
… | …10000010010110110100101 |
3 | 2122012200121000121101102222 |
4 | 10210222300300102312211 |
5 | 10114003340044030041 |
6 | 110435154252442125 |
7 | 4144021111100120 |
oct | 444526060226645 |
9 | 78180530541388 |
10 | 20112002330021 |
11 | 64544a7aa6348 |
12 | 2309a10a79345 |
13 | b2b7275926b4 |
14 | 4d75d73453b7 |
15 | 24d25cb5174b |
hex | 124ab0c12da5 |
20112002330021 has 8 divisors (see below), whose sum is σ = 23308879964544. Its totient is φ = 16996058306640.
The previous prime is 20112002329981. The next prime is 20112002330029. The reversal of 20112002330021 is 12003320021102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20112002330021 - 222 = 20111998135717 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 (20112002330029) 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, 20233402250 + ... + 20233403243.
It is an arithmetic number, because the mean of its divisors is an integer number (2913609995568).
Almost surely, 220112002330021 is an apocalyptic number.
It is an amenable number.
20112002330021 is a deficient number, since it is larger than the sum of its proper divisors (3196877634523).
20112002330021 is an equidigital number, since it uses as much as digits as its factorization.
20112002330021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40466805571.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20112002330021 its reverse (12003320021102), we get a palindrome (32115322351123).
The spelling of 20112002330021 in words is "twenty trillion, one hundred twelve billion, two million, three hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •