Base | Representation |
---|---|
bin | 110001001100… |
… | …0011010100000 |
3 | 1210112021101100 |
4 | 1202120122200 |
5 | 23100240422 |
6 | 2320434400 |
7 | 432132555 |
oct | 142303240 |
9 | 53467340 |
10 | 25790112 |
11 | 13615547 |
12 | 8778a00 |
13 | 545ca2a |
14 | 35d4a2c |
15 | 23e67ac |
hex | 18986a0 |
25790112 has 72 divisors (see below), whose sum is σ = 73955700. Its totient is φ = 8524800.
The previous prime is 25790099. The next prime is 25790119. The reversal of 25790112 is 21109752.
It can be written as a sum of positive squares in 2 ways, for example, as 25765776 + 24336 = 5076^2 + 156^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25790119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 42612 + ... + 43212.
Almost surely, 225790112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25790112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36977850).
25790112 is an abundant number, since it is smaller than the sum of its proper divisors (48165588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25790112 is a wasteful number, since it uses less digits than its factorization.
25790112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766 (or 755 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 25790112 is about 5078.3965973524. The cubic root of 25790112 is about 295.4502823756.
Adding to 25790112 its reverse (21109752), we get a palindrome (46899864).
The spelling of 25790112 in words is "twenty-five million, seven hundred ninety thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •