Base | Representation |
---|---|
bin | 10010101110110010… |
… | …000111101000001101 |
3 | 1220220122201210222210 |
4 | 102232302013220031 |
5 | 312142213240323 |
6 | 13123415101033 |
7 | 1311254150406 |
oct | 225662075015 |
9 | 56818653883 |
10 | 20112243213 |
11 | 8590923007 |
12 | 3a93671779 |
13 | 1b86a1703a |
14 | d8b1829ad |
15 | 7caa3d293 |
hex | 4aec87a0d |
20112243213 has 8 divisors (see below), whose sum is σ = 27183671488. Its totient is φ = 13224488544.
The previous prime is 20112243187. The next prime is 20112243233. The reversal of 20112243213 is 31234221102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20112243213 - 213 = 20112235021 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20112243213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112243233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45918145 + ... + 45918582.
It is an arithmetic number, because the mean of its divisors is an integer number (3397958936).
Almost surely, 220112243213 is an apocalyptic number.
It is an amenable number.
20112243213 is a deficient number, since it is larger than the sum of its proper divisors (7071428275).
20112243213 is an equidigital number, since it uses as much as digits as its factorization.
20112243213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91836803.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 20112243213 its reverse (31234221102), we get a palindrome (51346464315).
The spelling of 20112243213 in words is "twenty billion, one hundred twelve million, two hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •