Base | Representation |
---|---|
bin | 10010101001010010… |
… | …100011111110100111 |
3 | 1220200020022200012120 |
4 | 102221102203332213 |
5 | 312000120202042 |
6 | 13110323521023 |
7 | 1306054624503 |
oct | 225122437647 |
9 | 56606280176 |
10 | 20020084647 |
11 | 85438a7a02 |
12 | 3a68829173 |
13 | 1b708ba744 |
14 | d7cc33303 |
15 | 7c28d6dec |
hex | 4a94a3fa7 |
20020084647 has 8 divisors (see below), whose sum is σ = 27031338240. Its totient is φ = 13177777080.
The previous prime is 20020084607. The next prime is 20020084687. The reversal of 20020084647 is 74648002002.
It is an interprime number because it is at equal distance from previous prime (20020084607) and next prime (20020084687).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20020084647 - 210 = 20020083623 is a prime.
It is a super-2 number, since 2×200200846472 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020084607) 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, 42236229 + ... + 42236702.
It is an arithmetic number, because the mean of its divisors is an integer number (3378917280).
Almost surely, 220020084647 is an apocalyptic number.
20020084647 is a deficient number, since it is larger than the sum of its proper divisors (7011253593).
20020084647 is an equidigital number, since it uses as much as digits as its factorization.
20020084647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84473013.
The product of its (nonzero) digits is 21504, while the sum is 33.
Adding to 20020084647 its reverse (74648002002), we get a palindrome (94668086649).
The spelling of 20020084647 in words is "twenty billion, twenty million, eighty-four thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •