Base | Representation |
---|---|
bin | 10000010110010111011… |
… | …01001011000011111001 |
3 | 1222201000020212202011202 |
4 | 20023023231023003321 |
5 | 33200442410140423 |
6 | 1110023122303545 |
7 | 55405006550246 |
oct | 10131355130371 |
9 | 1881006782152 |
10 | 561763365113 |
11 | 1a72738578a5 |
12 | 90a594b7bb5 |
13 | 40c8800c072 |
14 | 1d291d745cd |
15 | e92d0a4728 |
hex | 82cbb4b0f9 |
561763365113 has 8 divisors (see below), whose sum is σ = 562314076896. Its totient is φ = 561212776800.
The previous prime is 561763365083. The next prime is 561763365143. The reversal of 561763365113 is 311563367165.
561763365113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (561763365083) and next prime (561763365143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 561763365113 - 216 = 561763299577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (561763365143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10947845 + ... + 10999037.
It is an arithmetic number, because the mean of its divisors is an integer number (70289259612).
Almost surely, 2561763365113 is an apocalyptic number.
It is an amenable number.
561763365113 is a deficient number, since it is larger than the sum of its proper divisors (550711783).
561763365113 is a wasteful number, since it uses less digits than its factorization.
561763365113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61735.
The product of its digits is 1020600, while the sum is 47.
The spelling of 561763365113 in words is "five hundred sixty-one billion, seven hundred sixty-three million, three hundred sixty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •