Base | Representation |
---|---|
bin | 11001101110110010110101… |
… | …10010110110110010100101 |
3 | 21102100022200222221111101110 |
4 | 30313121122302312302211 |
5 | 24404030322121013230 |
6 | 320202022044015233 |
7 | 14630005646014401 |
oct | 1467313262666245 |
9 | 242308628844343 |
10 | 56583422438565 |
11 | 17035992926840 |
12 | 641a2b5831519 |
13 | 2575a420b6809 |
14 | dd891bb24101 |
15 | 681ce83d54b0 |
hex | 33765acb6ca5 |
56583422438565 has 32 divisors (see below), whose sum is σ = 98978030186112. Its totient is φ = 27374876000000.
The previous prime is 56583422438539. The next prime is 56583422438671.
56583422438565 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56583422438565 - 235 = 56549062700197 is a prime.
It is a super-2 number, since 2×565834224385652 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 56583422438496 and 56583422438505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 371865186 + ... + 372017315.
It is an arithmetic number, because the mean of its divisors is an integer number (3093063443316).
Almost surely, 256583422438565 is an apocalyptic number.
56583422438565 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56583422438565 is a deficient number, since it is larger than the sum of its proper divisors (42394607747547).
56583422438565 is a wasteful number, since it uses less digits than its factorization.
56583422438565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 743882981.
The product of its digits is 829440000, while the sum is 66.
The spelling of 56583422438565 in words is "fifty-six trillion, five hundred eighty-three billion, four hundred twenty-two million, four hundred thirty-eight thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •