Base | Representation |
---|---|
bin | 101111111011… |
… | …1110001110001 |
3 | 1202021211211012 |
4 | 1133313301301 |
5 | 22413212040 |
6 | 2254400305 |
7 | 423422363 |
oct | 137676161 |
9 | 52254735 |
10 | 25132145 |
11 | 13206175 |
12 | 8500095 |
13 | 528c3bc |
14 | 34a2d33 |
15 | 2316865 |
hex | 17f7c71 |
25132145 has 4 divisors (see below), whose sum is σ = 30158580. Its totient is φ = 20105712.
The previous prime is 25132141. The next prime is 25132181. The reversal of 25132145 is 54123152.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5276209 + 19855936 = 2297^2 + 4456^2 .
It is a cyclic number.
It is not a de Polignac number, because 25132145 - 22 = 25132141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 25132145.
It is not an unprimeable number, because it can be changed into a prime (25132141) 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, 2513210 + ... + 2513219.
It is an arithmetic number, because the mean of its divisors is an integer number (7539645).
Almost surely, 225132145 is an apocalyptic number.
It is an amenable number.
25132145 is a deficient number, since it is larger than the sum of its proper divisors (5026435).
25132145 is an equidigital number, since it uses as much as digits as its factorization.
25132145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5026434.
The product of its digits is 1200, while the sum is 23.
The square root of 25132145 is about 5013.1970836982. The cubic root of 25132145 is about 292.9160611748.
Adding to 25132145 its reverse (54123152), we get a palindrome (79255297).
The spelling of 25132145 in words is "twenty-five million, one hundred thirty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •