Base | Representation |
---|---|
bin | 110001011111… |
… | …1011011110101 |
3 | 1210211101121221 |
4 | 1202333123311 |
5 | 23120344231 |
6 | 2324110341 |
7 | 433366543 |
oct | 142773365 |
9 | 53741557 |
10 | 25949941 |
11 | 13714636 |
12 | 88353b1 |
13 | 54b76c4 |
14 | 3636d93 |
15 | 2428d11 |
hex | 18bf6f5 |
25949941 has 4 divisors (see below), whose sum is σ = 26553472. Its totient is φ = 25346412.
The previous prime is 25949933. The next prime is 25949977. The reversal of 25949941 is 14994952.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 25949941 - 23 = 25949933 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43), and also a Moran number because the ratio is a prime number: 603487 = 25949941 / (2 + 5 + 9 + 4 + 9 + 9 + 4 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25949981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 301701 + ... + 301786.
It is an arithmetic number, because the mean of its divisors is an integer number (6638368).
Almost surely, 225949941 is an apocalyptic number.
It is an amenable number.
25949941 is a deficient number, since it is larger than the sum of its proper divisors (603531).
25949941 is an equidigital number, since it uses as much as digits as its factorization.
25949941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603530.
The product of its digits is 116640, while the sum is 43.
The square root of 25949941 is about 5094.1084597798. The cubic root of 25949941 is about 296.0593570091.
The spelling of 25949941 in words is "twenty-five million, nine hundred forty-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •