Base | Representation |
---|---|
bin | 1010001010010011110101 |
3 | 12000022212102 |
4 | 22022103311 |
5 | 1140214134 |
6 | 133031445 |
7 | 31432541 |
oct | 12122365 |
9 | 5008772 |
10 | 2663669 |
11 | 155a288 |
12 | a85585 |
13 | 723548 |
14 | 4d4a21 |
15 | 37937e |
hex | 28a4f5 |
2663669 has 2 divisors, whose sum is σ = 2663670. Its totient is φ = 2663668.
The previous prime is 2663651. The next prime is 2663671. The reversal of 2663669 is 9663662.
2663669 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., 1876900 + 786769 = 1370^2 + 887^2 .
It is a cyclic number.
It is not a de Polignac number, because 2663669 - 216 = 2598133 is a prime.
It is a super-2 number, since 2×26636692 = 14190265083122, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 2663671, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2663069) 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, 1331834 + 1331835.
It is an arithmetic number, because the mean of its divisors is an integer number (1331835).
22663669 is an apocalyptic number.
It is an amenable number.
2663669 is a deficient number, since it is larger than the sum of its proper divisors (1).
2663669 is an equidigital number, since it uses as much as digits as its factorization.
2663669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69984, while the sum is 38.
The square root of 2663669 is about 1632.0750595484. The cubic root of 2663669 is about 138.6202737380.
The spelling of 2663669 in words is "two million, six hundred sixty-three thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •