Base | Representation |
---|---|
bin | 101000011101110… |
… | …001001000011001 |
3 | 1202022110021211021 |
4 | 220131301020121 |
5 | 2342244021212 |
6 | 151211002441 |
7 | 22552326064 |
oct | 5035611031 |
9 | 1668407737 |
10 | 678892057 |
11 | 319242718 |
12 | 16b439421 |
13 | aa85b89c |
14 | 662418db |
15 | 3e903307 |
hex | 28771219 |
678892057 has 4 divisors (see below), whose sum is σ = 681936640. Its totient is φ = 675847476.
The previous prime is 678892051. The next prime is 678892069. The reversal of 678892057 is 750298876.
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.
It is a cyclic number.
It is not a de Polignac number, because 678892057 - 27 = 678891929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 678891995 and 678892013.
It is not an unprimeable number, because it can be changed into a prime (678892051) 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 3 ways as a sum of consecutive naturals, for example, 1521957 + ... + 1522402.
It is an arithmetic number, because the mean of its divisors is an integer number (170484160).
Almost surely, 2678892057 is an apocalyptic number.
It is an amenable number.
678892057 is a deficient number, since it is larger than the sum of its proper divisors (3044583).
678892057 is a wasteful number, since it uses less digits than its factorization.
678892057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3044582.
The product of its (nonzero) digits is 1693440, while the sum is 52.
The square root of 678892057 is about 26055.5571231935. The cubic root of 678892057 is about 878.8880829829. Note that the first 3 decimals are identical.
The spelling of 678892057 in words is "six hundred seventy-eight million, eight hundred ninety-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •