Base | Representation |
---|---|
bin | 10111100100000000001… |
… | …11000101101000011101 |
3 | 2212101201122020111202021 |
4 | 23302000013011220131 |
5 | 101231031404141443 |
6 | 1415532050100141 |
7 | 112330502412232 |
oct | 13620007055035 |
9 | 2771648214667 |
10 | 809603193373 |
11 | 292394995047 |
12 | 110aa657a651 |
13 | 5b4646a2c10 |
14 | 2b283915789 |
15 | 160d641c9ed |
hex | bc801c5a1d |
809603193373 has 16 divisors (see below), whose sum is σ = 892497263616. Its totient is φ = 729728190720.
The previous prime is 809603193367. The next prime is 809603193401. The reversal of 809603193373 is 373391306908.
It is a cyclic number.
It is not a de Polignac number, because 809603193373 - 29 = 809603192861 is a prime.
It is a super-2 number, since 2×8096031933732 (a number of 25 digits) contains 22 as substring.
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 809603193373.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (809603190373) 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 15 ways as a sum of consecutive naturals, for example, 1273836 + ... + 1800517.
It is an arithmetic number, because the mean of its divisors is an integer number (55781078976).
Almost surely, 2809603193373 is an apocalyptic number.
It is an amenable number.
809603193373 is a deficient number, since it is larger than the sum of its proper divisors (82894070243).
809603193373 is a wasteful number, since it uses less digits than its factorization.
809603193373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3074844.
The product of its (nonzero) digits is 2204496, while the sum is 52.
The spelling of 809603193373 in words is "eight hundred nine billion, six hundred three million, one hundred ninety-three thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •