Base | Representation |
---|---|
bin | 110000111000… |
… | …1100110010101 |
3 | 1210020012021221 |
4 | 1201301212111 |
5 | 23030144000 |
6 | 2313210341 |
7 | 430601212 |
oct | 141614625 |
9 | 53205257 |
10 | 25631125 |
11 | 13517053 |
12 | 87009b1 |
13 | 5405560 |
14 | 3592b09 |
15 | 23b461a |
hex | 1871995 |
25631125 has 16 divisors (see below), whose sum is σ = 34450416. Its totient is φ = 18926400.
The previous prime is 25631117. The next prime is 25631143. The reversal of 25631125 is 52113652.
It can be written as a sum of positive squares in 8 ways, for example, as 12103441 + 13527684 = 3479^2 + 3678^2 .
It is not a de Polignac number, because 25631125 - 23 = 25631117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 25631125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6262 + ... + 9511.
It is an arithmetic number, because the mean of its divisors is an integer number (2153151).
Almost surely, 225631125 is an apocalyptic number.
25631125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
25631125 is a deficient number, since it is larger than the sum of its proper divisors (8819291).
25631125 is a wasteful number, since it uses less digits than its factorization.
25631125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15801 (or 15791 counting only the distinct ones).
The product of its digits is 1800, while the sum is 25.
The square root of 25631125 is about 5062.7191310599. The cubic root of 25631125 is about 294.8419147255.
Adding to 25631125 its reverse (52113652), we get a palindrome (77744777).
The spelling of 25631125 in words is "twenty-five million, six hundred thirty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •