Base | Representation |
---|---|
bin | 101000110011100… |
… | …100001111011100 |
3 | 1202201012121110122 |
4 | 220303210033130 |
5 | 2400224401203 |
6 | 151533254112 |
7 | 22652026052 |
oct | 5063441734 |
9 | 1681177418 |
10 | 684606428 |
11 | 321495a40 |
12 | 171334338 |
13 | abaac87c |
14 | 66ccc1d2 |
15 | 40181538 |
hex | 28ce43dc |
684606428 has 12 divisors (see below), whose sum is σ = 1306975992. Its totient is φ = 311184720.
The previous prime is 684606421. The next prime is 684606497. The reversal of 684606428 is 824606486.
684606428 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×6846064282 = 937371922517838368, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44), and also a Moran number because the ratio is a prime number: 15559237 = 684606428 / (6 + 8 + 4 + 6 + 0 + 6 + 4 + 2 + 8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (684606421) 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, 7779575 + ... + 7779662.
It is an arithmetic number, because the mean of its divisors is an integer number (108914666).
Almost surely, 2684606428 is an apocalyptic number.
It is an amenable number.
684606428 is a deficient number, since it is larger than the sum of its proper divisors (622369564).
684606428 is a wasteful number, since it uses less digits than its factorization.
684606428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15559252 (or 15559250 counting only the distinct ones).
The product of its (nonzero) digits is 442368, while the sum is 44.
The square root of 684606428 is about 26164.9847697261. The cubic root of 684606428 is about 881.3471223508.
The spelling of 684606428 in words is "six hundred eighty-four million, six hundred six thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •