Base | Representation |
---|---|
bin | 110000001111… |
… | …1100001011101 |
3 | 1202121010010200 |
4 | 1200133201131 |
5 | 22433414231 |
6 | 2302054113 |
7 | 425001120 |
oct | 140374135 |
9 | 52533120 |
10 | 25294941 |
11 | 13307511 |
12 | 857a339 |
13 | 5318529 |
14 | 35063b7 |
15 | 2349be6 |
hex | 181f85d |
25294941 has 12 divisors (see below), whose sum is σ = 41756832. Its totient is φ = 14454216.
The previous prime is 25294903. The next prime is 25294987. The reversal of 25294941 is 14949252.
It is not a de Polignac number, because 25294941 - 29 = 25294429 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 25294896 and 25294905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25294901) 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 in 11 ways as a sum of consecutive naturals, for example, 200691 + ... + 200816.
It is an arithmetic number, because the mean of its divisors is an integer number (3479736).
Almost surely, 225294941 is an apocalyptic number.
25294941 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
25294941 is a deficient number, since it is larger than the sum of its proper divisors (16461891).
25294941 is a wasteful number, since it uses less digits than its factorization.
25294941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401520 (or 401517 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The square root of 25294941 is about 5029.4076191933. The cubic root of 25294941 is about 293.5471648782.
The spelling of 25294941 in words is "twenty-five million, two hundred ninety-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •