Base | Representation |
---|---|
bin | 1101011111000… |
… | …0010101111001 |
3 | 10221102111022122 |
4 | 3113300111321 |
5 | 103434341334 |
6 | 5340131025 |
7 | 1254512645 |
oct | 327602571 |
9 | 127374278 |
10 | 56558969 |
11 | 29a20655 |
12 | 16b36a75 |
13 | b94395c |
14 | 7723c25 |
15 | 4e7332e |
hex | 35f0579 |
56558969 has 4 divisors (see below), whose sum is σ = 56574096. Its totient is φ = 56543844.
The previous prime is 56558959. The next prime is 56559011. The reversal of 56558969 is 96985565.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 56558969 - 28 = 56558713 is a prime.
It is a super-2 number, since 2×565589692 = 6397833948685922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 56558969.
It is not an unprimeable number, because it can be changed into a prime (56558959) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2582 + ... + 10944.
It is an arithmetic number, because the mean of its divisors is an integer number (14143524).
Almost surely, 256558969 is an apocalyptic number.
It is an amenable number.
56558969 is a deficient number, since it is larger than the sum of its proper divisors (15127).
56558969 is an equidigital number, since it uses as much as digits as its factorization.
56558969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15126.
The product of its digits is 2916000, while the sum is 53.
The square root of 56558969 is about 7520.5697257588. The cubic root of 56558969 is about 383.8549641255.
The spelling of 56558969 in words is "fifty-six million, five hundred fifty-eight thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •