Base | Representation |
---|---|
bin | 1101100100010… |
… | …1111001111111 |
3 | 10222002022002000 |
4 | 3121011321333 |
5 | 104032100224 |
6 | 5351433343 |
7 | 1260502506 |
oct | 331057177 |
9 | 128068060 |
10 | 56909439 |
11 | 2a13a9a4 |
12 | 17085853 |
13 | ba37332 |
14 | 77b583d |
15 | 4ee20c9 |
hex | 3645e7f |
56909439 has 16 divisors (see below), whose sum is σ = 85903200. Its totient is φ = 37222848.
The previous prime is 56909431. The next prime is 56909449. The reversal of 56909439 is 93490965.
It is a happy number.
It is not a de Polignac number, because 56909439 - 23 = 56909431 is a prime.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 56909394 and 56909403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56909431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18454 + ... + 21315.
It is an arithmetic number, because the mean of its divisors is an integer number (5368950).
Almost surely, 256909439 is an apocalyptic number.
56909439 is a deficient number, since it is larger than the sum of its proper divisors (28993761).
56909439 is a wasteful number, since it uses less digits than its factorization.
56909439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39831 (or 39825 counting only the distinct ones).
The product of its (nonzero) digits is 262440, while the sum is 45.
The square root of 56909439 is about 7543.8345024265. The cubic root of 56909439 is about 384.6461898229.
It can be divided in two parts, 5690 and 9439, that added together give a square (15129 = 1232).
The spelling of 56909439 in words is "fifty-six million, nine hundred nine thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •