Base | Representation |
---|---|
bin | 110100101100111110… |
… | …010001111001000101 |
3 | 12102001210101001121110 |
4 | 310230332101321011 |
5 | 1411343302123230 |
6 | 41555140435233 |
7 | 4042221254436 |
oct | 645476217105 |
9 | 172053331543 |
10 | 56589098565 |
11 | 21aaa08635a |
12 | ab736a8b19 |
13 | 544abb840c |
14 | 2a4b88948d |
15 | 17130954b0 |
hex | d2cf91e45 |
56589098565 has 32 divisors (see below), whose sum is σ = 90951315840. Its totient is φ = 30044749824.
The previous prime is 56589098561. The next prime is 56589098591.
56589098565 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56589098565 - 22 = 56589098561 is a prime.
It is a super-5 number, since 5×565890985655 (a number of 55 digits) contains 55555 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 56589098496 and 56589098505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56589098561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8049582 + ... + 8056608.
It is an arithmetic number, because the mean of its divisors is an integer number (2842228620).
Almost surely, 256589098565 is an apocalyptic number.
It is an amenable number.
56589098565 is a deficient number, since it is larger than the sum of its proper divisors (34362217275).
56589098565 is a wasteful number, since it uses less digits than its factorization.
56589098565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9381.
The product of its (nonzero) digits is 116640000, while the sum is 66.
The spelling of 56589098565 in words is "fifty-six billion, five hundred eighty-nine million, ninety-eight thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •