Base | Representation |
---|---|
bin | 11001101010101110010010… |
… | …11010111111110111000001 |
3 | 21101211221122122222201201122 |
4 | 30311113021122333313001 |
5 | 24344232334400100330 |
6 | 320013450103042025 |
7 | 14613624436315664 |
oct | 1465271132776701 |
9 | 241757578881648 |
10 | 56443544534465 |
11 | 16a91633456100 |
12 | 63b7178a40315 |
13 | 25657ac90371a |
14 | dd1c4c7d96db |
15 | 67d35d2805e5 |
hex | 3355c96bfdc1 |
56443544534465 has 48 divisors (see below), whose sum is σ = 78820892942400. Its totient is φ = 38664536929920.
The previous prime is 56443544534431. The next prime is 56443544534513.
56443544534465 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56443544534465 - 212 = 56443544530369 is a prime.
It is a super-2 number, since 2×564435445344652 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56443544534398 and 56443544534407.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12202895 + ... + 16180164.
It is an arithmetic number, because the mean of its divisors is an integer number (1642101936300).
Almost surely, 256443544534465 is an apocalyptic number.
56443544534465 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56443544534465 is a deficient number, since it is larger than the sum of its proper divisors (22377348407935).
56443544534465 is a wasteful number, since it uses less digits than its factorization.
56443544534465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28383278 (or 28383267 counting only the distinct ones).
The product of its digits is 829440000, while the sum is 62.
The spelling of 56443544534465 in words is "fifty-six trillion, four hundred forty-three billion, five hundred forty-four million, five hundred thirty-four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •