Base | Representation |
---|---|
bin | 1000000001101100011010110… |
… | …1011101101111001101000000 |
3 | 2202001211120000010210011122021 |
4 | 2000123012231131233031000 |
5 | 1043012342133113424433 |
6 | 5321131152544251224 |
7 | 226653235242466651 |
oct | 20033065535571500 |
9 | 2661746003704567 |
10 | 564812584514368 |
11 | 153a6a743363133 |
12 | 53420567910b14 |
13 | 1b3207a1284c78 |
14 | 9d6910994b528 |
15 | 454711147d22d |
hex | 201b1ad76f340 |
564812584514368 has 56 divisors (see below), whose sum is σ = 1124513943730632. Its totient is φ = 281471067193344.
The previous prime is 564812584514357. The next prime is 564812584514429. The reversal of 564812584514368 is 863415485218465.
It can be written as a sum of positive squares in 4 ways, for example, as 73501952995584 + 491310631518784 = 8573328^2 + 22165528^2 .
It is a junction number, because it is equal to n+sod(n) for n = 564812584514297 and 564812584514306.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57962730 + ... + 67002262.
It is an arithmetic number, because the mean of its divisors is an integer number (20080606138047).
Almost surely, 2564812584514368 is an apocalyptic number.
It is an amenable number.
564812584514368 is a deficient number, since it is larger than the sum of its proper divisors (559701359216264).
564812584514368 is a wasteful number, since it uses less digits than its factorization.
564812584514368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9042779 (or 9042769 counting only the distinct ones).
The product of its digits is 884736000, while the sum is 70.
The spelling of 564812584514368 in words is "five hundred sixty-four trillion, eight hundred twelve billion, five hundred eighty-four million, five hundred fourteen thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •