Base | Representation |
---|---|
bin | 101000001100111… |
… | …110010011001101 |
3 | 1202000011121201102 |
4 | 220030332103031 |
5 | 2340132131144 |
6 | 150532352445 |
7 | 22500031556 |
oct | 5014762315 |
9 | 1660147642 |
10 | 674489549 |
11 | 316805a88 |
12 | 169a75725 |
13 | a9979a56 |
14 | 6581732d |
15 | 3e333b4e |
hex | 2833e4cd |
674489549 has 2 divisors, whose sum is σ = 674489550. Its totient is φ = 674489548.
The previous prime is 674489533. The next prime is 674489551. The reversal of 674489549 is 945984476.
674489549 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 561216100 + 113273449 = 23690^2 + 10643^2 .
It is a cyclic number.
It is not a de Polignac number, because 674489549 - 24 = 674489533 is a prime.
Together with 674489551, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 674489494 and 674489503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (674489509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 337244774 + 337244775.
It is an arithmetic number, because the mean of its divisors is an integer number (337244775).
Almost surely, 2674489549 is an apocalyptic number.
It is an amenable number.
674489549 is a deficient number, since it is larger than the sum of its proper divisors (1).
674489549 is an equidigital number, since it uses as much as digits as its factorization.
674489549 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8709120, while the sum is 56.
The square root of 674489549 is about 25970.9366215391. The cubic root of 674489549 is about 876.9841445490.
The spelling of 674489549 in words is "six hundred seventy-four million, four hundred eighty-nine thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •