Base | Representation |
---|---|
bin | 1000000001101000011010110… |
… | …1110010001110110101000101 |
3 | 2202001120222122100002000000210 |
4 | 2000122012231302032311011 |
5 | 1043010230421311110203 |
6 | 5321035430310430033 |
7 | 226645253401315215 |
oct | 20032065562166505 |
9 | 2661528570060023 |
10 | 564743870410053 |
11 | 153a43592005574 |
12 | 5340b18b662319 |
13 | 1b317170377849 |
14 | 9d65a6ba24245 |
15 | 454543dbc3803 |
hex | 201a1adc8ed45 |
564743870410053 has 8 divisors (see below), whose sum is σ = 753041116521568. Its totient is φ = 376471268952624.
The previous prime is 564743870410019. The next prime is 564743870410079. The reversal of 564743870410053 is 350014078347465.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 564743870410053 - 221 = 564743868312901 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 564743870409975 and 564743870410002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (564743870400053) 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, 6161110051 + ... + 6161201712.
It is an arithmetic number, because the mean of its divisors is an integer number (94130139565196).
Almost surely, 2564743870410053 is an apocalyptic number.
It is an amenable number.
564743870410053 is a deficient number, since it is larger than the sum of its proper divisors (188297246111515).
564743870410053 is a wasteful number, since it uses less digits than its factorization.
564743870410053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12322327043.
The product of its (nonzero) digits is 33868800, while the sum is 57.
The spelling of 564743870410053 in words is "five hundred sixty-four trillion, seven hundred forty-three billion, eight hundred seventy million, four hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •