Base | Representation |
---|---|
bin | 11001101101101000100111… |
… | …10110100111000001100101 |
3 | 21102012111212010201122121021 |
4 | 30312310103312213001211 |
5 | 24402402221322101230 |
6 | 320131432205251141 |
7 | 14624065363636462 |
oct | 1466642366470145 |
9 | 242174763648537 |
10 | 56543577534565 |
11 | 1701aaa6480710 |
12 | 6412635863ab1 |
13 | 25720621c8844 |
14 | dd6a1bdaa669 |
15 | 680c65337c7a |
hex | 336d13da7065 |
56543577534565 has 16 divisors (see below), whose sum is σ = 74053134461376. Its totient is φ = 41104573430400.
The previous prime is 56543577534553. The next prime is 56543577534569.
56543577534565 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-56543577534565 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56543577534494 and 56543577534503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56543577534569) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 225228567 + ... + 225479476.
It is an arithmetic number, because the mean of its divisors is an integer number (4628320903836).
Almost surely, 256543577534565 is an apocalyptic number.
56543577534565 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56543577534565 is a deficient number, since it is larger than the sum of its proper divisors (17509556926811).
56543577534565 is a wasteful number, since it uses less digits than its factorization.
56543577534565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 450710340.
The product of its digits is 3969000000, while the sum is 70.
The spelling of 56543577534565 in words is "fifty-six trillion, five hundred forty-three billion, five hundred seventy-seven million, five hundred thirty-four thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •