Base | Representation |
---|---|
bin | 110001011011… |
… | …1011000001101 |
3 | 1210202201100201 |
4 | 1202313120031 |
5 | 23113320231 |
6 | 2323253501 |
7 | 433201411 |
oct | 142673015 |
9 | 53681321 |
10 | 25916941 |
11 | 136a1866 |
12 | 881a291 |
13 | 54a568b |
14 | 3628d41 |
15 | 241e161 |
hex | 18b760d |
25916941 has 2 divisors, whose sum is σ = 25916942. Its totient is φ = 25916940.
The previous prime is 25916939. The next prime is 25917011. The reversal of 25916941 is 14961952.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13286025 + 12630916 = 3645^2 + 3554^2 .
It is a cyclic number.
It is not a de Polignac number, because 25916941 - 21 = 25916939 is a prime.
Together with 25916939, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 25916941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25913941) 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, 12958470 + 12958471.
It is an arithmetic number, because the mean of its divisors is an integer number (12958471).
Almost surely, 225916941 is an apocalyptic number.
It is an amenable number.
25916941 is a deficient number, since it is larger than the sum of its proper divisors (1).
25916941 is an equidigital number, since it uses as much as digits as its factorization.
25916941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19440, while the sum is 37.
The square root of 25916941 is about 5090.8683935062. The cubic root of 25916941 is about 295.9338062661.
The spelling of 25916941 in words is "twenty-five million, nine hundred sixteen thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •