Base | Representation |
---|---|
bin | 1000000000000110001001001… |
… | …1011001011010110000011101 |
3 | 2201211121120200021201112202111 |
4 | 2000001202103121122300131 |
5 | 1042300100133410102430 |
6 | 5313304043420154021 |
7 | 226412263214642422 |
oct | 20001422331326035 |
9 | 2654546607645674 |
10 | 563055505550365 |
11 | 153452554069123 |
12 | 53197b19698911 |
13 | 1b223ba2319ba9 |
14 | 9d08063679d49 |
15 | 4516574aa3c2a |
hex | 200189365ac1d |
563055505550365 has 8 divisors (see below), whose sum is σ = 679712514485760. Its totient is φ = 447747132556752.
The previous prime is 563055505550333. The next prime is 563055505550371.
563055505550365 is nontrivially palindromic in base 10.
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 563055505550365 - 25 = 563055505550333 is a prime.
It is a super-2 number, since 2×5630555055503652 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 337158984525 + ... + 337158986194.
It is an arithmetic number, because the mean of its divisors is an integer number (84964064310720).
Almost surely, 2563055505550365 is an apocalyptic number.
It is an amenable number.
563055505550365 is a deficient number, since it is larger than the sum of its proper divisors (116657008935395).
563055505550365 is a wasteful number, since it uses less digits than its factorization.
563055505550365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674317970891.
The product of its (nonzero) digits is 126562500, while the sum is 58.
The spelling of 563055505550365 in words is "five hundred sixty-three trillion, fifty-five billion, five hundred five million, five hundred fifty thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •