Base | Representation |
---|---|
bin | 110000111000… |
… | …1010100110000 |
3 | 1210020010202021 |
4 | 1201301110300 |
5 | 23030130000 |
6 | 2313201224 |
7 | 430565014 |
oct | 141612460 |
9 | 53203667 |
10 | 25630000 |
11 | 13516220 |
12 | 8700214 |
13 | 5404ba6 |
14 | 3592544 |
15 | 23b411a |
hex | 1871530 |
25630000 has 100 divisors (see below), whose sum is σ = 67984488. Its totient is φ = 9280000.
The previous prime is 25629973. The next prime is 25630009. The reversal of 25630000 is 3652.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (25630009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 109884 + ... + 110116.
Almost surely, 225630000 is an apocalyptic number.
25630000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25630000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33992244).
25630000 is an abundant number, since it is smaller than the sum of its proper divisors (42354488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25630000 is a wasteful number, since it uses less digits than its factorization.
25630000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272 (or 251 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 25630000 is about 5062.6080235389. The cubic root of 25630000 is about 294.8376009337.
Adding to 25630000 its reverse (3652), we get a palindrome (25633652).
The spelling of 25630000 in words is "twenty-five million, six hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •