Base | Representation |
---|---|
bin | 110001000010… |
… | …1111010111001 |
3 | 1210101102110202 |
4 | 1202011322321 |
5 | 23040324421 |
6 | 2315051545 |
7 | 431365661 |
oct | 142057271 |
9 | 53342422 |
10 | 25714361 |
11 | 13573642 |
12 | 8740bb5 |
13 | 54343ca |
14 | 35b51a1 |
15 | 23ce10b |
hex | 1885eb9 |
25714361 has 2 divisors, whose sum is σ = 25714362. Its totient is φ = 25714360.
The previous prime is 25714349. The next prime is 25714363. The reversal of 25714361 is 16341752.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25694761 + 19600 = 5069^2 + 140^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-25714361 is a prime.
It is a super-2 number, since 2×257143612 = 1322456723276642, which contains 22 as substring.
Together with 25714363, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p1607744 and since 25714361 and 1607744 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (25714363) 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, 12857180 + 12857181.
It is an arithmetic number, because the mean of its divisors is an integer number (12857181).
Almost surely, 225714361 is an apocalyptic number.
It is an amenable number.
25714361 is a deficient number, since it is larger than the sum of its proper divisors (1).
25714361 is an equidigital number, since it uses as much as digits as its factorization.
25714361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5040, while the sum is 29.
The square root of 25714361 is about 5070.9329516372. The cubic root of 25714361 is about 295.1607320963.
The spelling of 25714361 in words is "twenty-five million, seven hundred fourteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •