Base | Representation |
---|---|
bin | 11001101110010000111001… |
… | …01010111110001011101011 |
3 | 21102021120200001210201021100 |
4 | 30313020130222332023223 |
5 | 24403231012240040430 |
6 | 320145405544412443 |
7 | 14625462252353142 |
oct | 1467103452761353 |
9 | 242246601721240 |
10 | 56565200315115 |
11 | 17029191a20788 |
12 | 641686b177123 |
13 | 25740c9b5414b |
14 | dd7aad9d6759 |
15 | 6815cd7a2960 |
hex | 33721cabe2eb |
56565200315115 has 12 divisors (see below), whose sum is σ = 98046347212944. Its totient is φ = 30168106834704.
The previous prime is 56565200315077. The next prime is 56565200315207. The reversal of 56565200315115 is 51151300256565.
56565200315115 is a `hidden beast` number, since 5 + 6 + 5 + 6 + 520 + 0 + 3 + 1 + 5 + 115 = 666.
It is not a de Polignac number, because 56565200315115 - 28 = 56565200314859 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45), and also a Moran number because the ratio is a prime number: 1257004451447 = 56565200315115 / (5 + 6 + 5 + 6 + 5 + 2 + 0 + 0 + 3 + 1 + 5 + 1 + 1 + 5).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 628502225679 + ... + 628502225768.
It is an arithmetic number, because the mean of its divisors is an integer number (8170528934412).
Almost surely, 256565200315115 is an apocalyptic number.
56565200315115 is a deficient number, since it is larger than the sum of its proper divisors (41481146897829).
56565200315115 is a wasteful number, since it uses less digits than its factorization.
56565200315115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1257004451458 (or 1257004451455 counting only the distinct ones).
The product of its (nonzero) digits is 675000, while the sum is 45.
The spelling of 56565200315115 in words is "fifty-six trillion, five hundred sixty-five billion, two hundred million, three hundred fifteen thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •