Base | Representation |
---|---|
bin | 110100001101101111… |
… | …100000101101111101 |
3 | 12100201021102212120121 |
4 | 310031233200231331 |
5 | 1404310133232222 |
6 | 41431142214541 |
7 | 4023226525345 |
oct | 641557405575 |
9 | 170637385517 |
10 | 56065133437 |
11 | 21860340625 |
12 | aa48124451 |
13 | 5396492191 |
14 | 29dc055d25 |
15 | 16d20965c7 |
hex | d0dbe0b7d |
56065133437 has 2 divisors, whose sum is σ = 56065133438. Its totient is φ = 56065133436.
The previous prime is 56065133347. The next prime is 56065133491. The reversal of 56065133437 is 73433156065.
Together with previous prime (56065133347) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43501862041 + 12563271396 = 208571^2 + 112086^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56065133437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56065133393 and 56065133402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56065163437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28032566718 + 28032566719.
It is an arithmetic number, because the mean of its divisors is an integer number (28032566719).
Almost surely, 256065133437 is an apocalyptic number.
It is an amenable number.
56065133437 is a deficient number, since it is larger than the sum of its proper divisors (1).
56065133437 is an equidigital number, since it uses as much as digits as its factorization.
56065133437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 680400, while the sum is 43.
The spelling of 56065133437 in words is "fifty-six billion, sixty-five million, one hundred thirty-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •