Base | Representation |
---|---|
bin | 1101100100011… |
… | …0101001010101 |
3 | 10222002110020020 |
4 | 3121012221111 |
5 | 104032144334 |
6 | 5351455353 |
7 | 1260514365 |
oct | 331065125 |
9 | 128073206 |
10 | 56912469 |
11 | 2a1421a9 |
12 | 17087559 |
13 | ba38823 |
14 | 77b69a5 |
15 | 4ee2e49 |
hex | 3646a55 |
56912469 has 16 divisors (see below), whose sum is σ = 78731520. Its totient is φ = 36541440.
The previous prime is 56912459. The next prime is 56912473. The reversal of 56912469 is 96421965.
It is a happy number.
56912469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56912469 - 25 = 56912437 is a prime.
It is a super-2 number, since 2×569124692 = 6478058255351922, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 56912469.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56912459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6789 + ... + 12645.
It is an arithmetic number, because the mean of its divisors is an integer number (4920720).
Almost surely, 256912469 is an apocalyptic number.
It is an amenable number.
56912469 is a deficient number, since it is larger than the sum of its proper divisors (21819051).
56912469 is a wasteful number, since it uses less digits than its factorization.
56912469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5980.
The product of its digits is 116640, while the sum is 42.
The square root of 56912469 is about 7544.0353260042. The cubic root of 56912469 is about 384.6530162082.
The spelling of 56912469 in words is "fifty-six million, nine hundred twelve thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •