Base | Representation |
---|---|
bin | 1001101100111000001101 |
3 | 11210012111112 |
4 | 21230320031 |
5 | 1122334432 |
6 | 130301405 |
7 | 30421223 |
oct | 11547015 |
9 | 4705445 |
10 | 2543117 |
11 | 1487755 |
12 | a27865 |
13 | 6b0705 |
14 | 4a2b13 |
15 | 3537b2 |
hex | 26ce0d |
2543117 has 2 divisors, whose sum is σ = 2543118. Its totient is φ = 2543116.
The previous prime is 2543113. The next prime is 2543129. The reversal of 2543117 is 7113452.
2543117 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2468041 + 75076 = 1571^2 + 274^2 .
It is a cyclic number.
It is not a de Polignac number, because 2543117 - 22 = 2543113 is a prime.
It is a Chen prime.
It is an Ulam number.
It is a junction number, because it is equal to n+sod(n) for n = 2543092 and 2543101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2543111) 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, 1271558 + 1271559.
It is an arithmetic number, because the mean of its divisors is an integer number (1271559).
22543117 is an apocalyptic number.
It is an amenable number.
2543117 is a deficient number, since it is larger than the sum of its proper divisors (1).
2543117 is an equidigital number, since it uses as much as digits as its factorization.
2543117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 840, while the sum is 23.
The square root of 2543117 is about 1594.7153350990. The cubic root of 2543117 is about 136.4966880097.
Adding to 2543117 its reverse (7113452), we get a palindrome (9656569).
The spelling of 2543117 in words is "two million, five hundred forty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •