Base | Representation |
---|---|
bin | 110000111000… |
… | …0010110111010 |
3 | 1210012221022200 |
4 | 1201300112322 |
5 | 23030013132 |
6 | 2313131030 |
7 | 430550331 |
oct | 141602672 |
9 | 53187280 |
10 | 25626042 |
11 | 13513252 |
12 | 86b9a76 |
13 | 5403150 |
14 | 3590d18 |
15 | 23b2d7c |
hex | 18705ba |
25626042 has 48 divisors (see below), whose sum is σ = 60464040. Its totient is φ = 7796736.
The previous prime is 25626019. The next prime is 25626043. The reversal of 25626042 is 24062652.
25626042 is a `hidden beast` number, since 2 + 56 + 2 + 604 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 10949481 + 14676561 = 3309^2 + 3831^2 .
It is a junction number, because it is equal to n+sod(n) for n = 25625997 and 25626015.
It is not an unprimeable number, because it can be changed into a prime (25626043) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22134 + ... + 23262.
Almost surely, 225626042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25626042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30232020).
25626042 is an abundant number, since it is smaller than the sum of its proper divisors (34837998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25626042 is a wasteful number, since it uses less digits than its factorization.
25626042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1247 (or 1244 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 25626042 is about 5062.2171032069. The cubic root of 25626042 is about 294.8224230523.
Adding to 25626042 its reverse (24062652), we get a palindrome (49688694).
The spelling of 25626042 in words is "twenty-five million, six hundred twenty-six thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •