Base | Representation |
---|---|
bin | 1000101100100100111101 |
3 | 11021211012212 |
4 | 20230210331 |
5 | 1040422431 |
6 | 120510205 |
7 | 25243322 |
oct | 10544475 |
9 | 4254185 |
10 | 2279741 |
11 | 1317892 |
12 | 91b365 |
13 | 61a879 |
14 | 434b49 |
15 | 30072b |
hex | 22c93d |
2279741 has 2 divisors, whose sum is σ = 2279742. Its totient is φ = 2279740.
The previous prime is 2279707. The next prime is 2279743. The reversal of 2279741 is 1479722.
2279741 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., 2102500 + 177241 = 1450^2 + 421^2 .
It is a cyclic number.
It is not a de Polignac number, because 2279741 - 214 = 2263357 is a prime.
It is a Sophie Germain prime.
Together with 2279743, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2279698 and 2279707.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2279743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1139870 + 1139871.
It is an arithmetic number, because the mean of its divisors is an integer number (1139871).
22279741 is an apocalyptic number.
It is an amenable number.
2279741 is a deficient number, since it is larger than the sum of its proper divisors (1).
2279741 is an equidigital number, since it uses as much as digits as its factorization.
2279741 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7056, while the sum is 32.
The square root of 2279741 is about 1509.8811211483. The cubic root of 2279741 is about 131.6119033772.
The spelling of 2279741 in words is "two million, two hundred seventy-nine thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •