Base | Representation |
---|---|
bin | 10010101101010101… |
… | …100010111010101110 |
3 | 1220211222001220002020 |
4 | 102231111202322232 |
5 | 312120010204343 |
6 | 13121151011010 |
7 | 1310540655345 |
oct | 225525427256 |
9 | 56758056066 |
10 | 20087975598 |
11 | 8579158429 |
12 | 3a87509a66 |
13 | 1b8199b2c2 |
14 | d87c66b5c |
15 | 7c8847b83 |
hex | 4ad562eae |
20087975598 has 8 divisors (see below), whose sum is σ = 40175951208. Its totient is φ = 6695991864.
The previous prime is 20087975597. The next prime is 20087975623. The reversal of 20087975598 is 89557978002.
It is a sphenic number, since it is the product of 3 distinct primes.
20087975598 is an admirable number.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20087975597) 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 3 ways as a sum of consecutive naturals, for example, 1673997961 + ... + 1673997972.
It is an arithmetic number, because the mean of its divisors is an integer number (5021993901).
Almost surely, 220087975598 is an apocalyptic number.
20087975598 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20087975598 is a wasteful number, since it uses less digits than its factorization.
20087975598 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3347995938.
The product of its (nonzero) digits is 12700800, while the sum is 60.
The spelling of 20087975598 in words is "twenty billion, eighty-seven million, nine hundred seventy-five thousand, five hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •