Base | Representation |
---|---|
bin | 1101100100101… |
… | …0000000011101 |
3 | 10222010011010011 |
4 | 3121022000131 |
5 | 104033114422 |
6 | 5352043221 |
7 | 1260602464 |
oct | 331120035 |
9 | 128104104 |
10 | 56926237 |
11 | 2a151585 |
12 | 17093511 |
13 | ba41b84 |
14 | 77bb9db |
15 | 4ee7077 |
hex | 364a01d |
56926237 has 4 divisors (see below), whose sum is σ = 57859516. Its totient is φ = 55992960.
The previous prime is 56926211. The next prime is 56926253. The reversal of 56926237 is 73262965.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19545241 + 37380996 = 4421^2 + 6114^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56926237 is a prime.
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 56926237.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56926277) 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, 466548 + ... + 466669.
It is an arithmetic number, because the mean of its divisors is an integer number (14464879).
Almost surely, 256926237 is an apocalyptic number.
It is an amenable number.
56926237 is a deficient number, since it is larger than the sum of its proper divisors (933279).
56926237 is an equidigital number, since it uses as much as digits as its factorization.
56926237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 933278.
The product of its digits is 136080, while the sum is 40.
The square root of 56926237 is about 7544.9477798060. The cubic root of 56926237 is about 384.6840315306.
The spelling of 56926237 in words is "fifty-six million, nine hundred twenty-six thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •