Base | Representation |
---|---|
bin | 110100101001100001… |
… | …111111010000100101 |
3 | 12101220202201011020122 |
4 | 310221201333100211 |
5 | 1411234011204230 |
6 | 41545315011325 |
7 | 4040620360064 |
oct | 645141772045 |
9 | 171822634218 |
10 | 56531350565 |
11 | 21a7a523438 |
12 | ab58299b45 |
13 | 543bc494c1 |
14 | 2a43d361db |
15 | 170ce89be5 |
hex | d2987f425 |
56531350565 has 4 divisors (see below), whose sum is σ = 67837620684. Its totient is φ = 45225080448.
The previous prime is 56531350531. The next prime is 56531350583. The reversal of 56531350565 is 56505313565.
56531350565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56505313565 = 5 ⋅11301062713.
It can be written as a sum of positive squares in 2 ways, for example, as 39305838049 + 17225512516 = 198257^2 + 131246^2 .
It is a cyclic number.
It is not a de Polignac number, because 56531350565 - 26 = 56531350501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5653135052 + ... + 5653135061.
It is an arithmetic number, because the mean of its divisors is an integer number (16959405171).
Almost surely, 256531350565 is an apocalyptic number.
It is an amenable number.
56531350565 is a deficient number, since it is larger than the sum of its proper divisors (11306270119).
56531350565 is a wasteful number, since it uses less digits than its factorization.
56531350565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11306270118.
The product of its (nonzero) digits is 1012500, while the sum is 44.
The spelling of 56531350565 in words is "fifty-six billion, five hundred thirty-one million, three hundred fifty thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •