Base | Representation |
---|---|
bin | 110000000000… |
… | …1000000010100 |
3 | 1202100202200000 |
4 | 1200001000110 |
5 | 22420414230 |
6 | 2255251300 |
7 | 423640515 |
oct | 140010024 |
9 | 52322600 |
10 | 25169940 |
11 | 13231604 |
12 | 8519b30 |
13 | 52a3673 |
14 | 34b2a0c |
15 | 2322b60 |
hex | 1801014 |
25169940 has 72 divisors (see below), whose sum is σ = 79191840. Its totient is φ = 6710688.
The previous prime is 25169939. The next prime is 25169951. The reversal of 25169940 is 4996152.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 25169895 and 25169904.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2271 + ... + 7449.
Almost surely, 225169940 is an apocalyptic number.
25169940 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 25169940, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39595920).
25169940 is an abundant number, since it is smaller than the sum of its proper divisors (54021900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25169940 is a wasteful number, since it uses less digits than its factorization.
25169940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5203 (or 5189 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The square root of 25169940 is about 5016.9652181374. The cubic root of 25169940 is about 293.0628216625.
The spelling of 25169940 in words is "twenty-five million, one hundred sixty-nine thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •