Base | Representation |
---|---|
bin | 101000010011110… |
… | …010001000110101 |
3 | 1202010112022112122 |
4 | 220103302020311 |
5 | 2341111242431 |
6 | 151034525325 |
7 | 22521145322 |
oct | 5023621065 |
9 | 1663468478 |
10 | 676274741 |
11 | 31781524a |
12 | 16a596845 |
13 | aa15348c |
14 | 65b5db49 |
15 | 3e587a7b |
hex | 284f2235 |
676274741 has 2 divisors, whose sum is σ = 676274742. Its totient is φ = 676274740.
The previous prime is 676274719. The next prime is 676274743. The reversal of 676274741 is 147472676.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 391644100 + 284630641 = 19790^2 + 16871^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-676274741 is a prime.
Together with 676274743, 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 = 676274692 and 676274701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (676274743) 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 as a sum of consecutive naturals, namely, 338137370 + 338137371.
It is an arithmetic number, because the mean of its divisors is an integer number (338137371).
Almost surely, 2676274741 is an apocalyptic number.
It is an amenable number.
676274741 is a deficient number, since it is larger than the sum of its proper divisors (1).
676274741 is an equidigital number, since it uses as much as digits as its factorization.
676274741 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 395136, while the sum is 44.
The square root of 676274741 is about 26005.2829440481. The cubic root of 676274741 is about 877.7571764818.
The spelling of 676274741 in words is "six hundred seventy-six million, two hundred seventy-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •