Base | Representation |
---|---|
bin | 1101100100000… |
… | …0101000011101 |
3 | 10222001012102221 |
4 | 3121000220131 |
5 | 104030402322 |
6 | 5351145341 |
7 | 1260352516 |
oct | 331005035 |
9 | 128035387 |
10 | 56887837 |
11 | 2a125746 |
12 | 17075251 |
13 | ba2a556 |
14 | 77aba0d |
15 | 4eda9c7 |
hex | 3640a1d |
56887837 has 4 divisors (see below), whose sum is σ = 56903040. Its totient is φ = 56872636.
The previous prime is 56887829. The next prime is 56887841. The reversal of 56887837 is 73878865.
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, and also an emirpimes, since its reverse is a distinct semiprime: 73878865 = 5 ⋅14775773.
It is a cyclic number.
It is not a de Polignac number, because 56887837 - 23 = 56887829 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56887847) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2388 + ... + 10930.
It is an arithmetic number, because the mean of its divisors is an integer number (14225760).
Almost surely, 256887837 is an apocalyptic number.
It is an amenable number.
56887837 is a deficient number, since it is larger than the sum of its proper divisors (15203).
56887837 is an equidigital number, since it uses as much as digits as its factorization.
56887837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15202.
The product of its digits is 2257920, while the sum is 52.
The square root of 56887837 is about 7542.4026012936. The cubic root of 56887837 is about 384.5975149534.
The spelling of 56887837 in words is "fifty-six million, eight hundred eighty-seven thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •