Base | Representation |
---|---|
bin | 101111111010… |
… | …1011010101010 |
3 | 1202021100120000 |
4 | 1133311122222 |
5 | 22412404344 |
6 | 2254243430 |
7 | 423352236 |
oct | 137653252 |
9 | 52240500 |
10 | 25122474 |
11 | 131a9983 |
12 | 84b6576 |
13 | 5287b90 |
14 | 349d5c6 |
15 | 2313a69 |
hex | 17f56aa |
25122474 has 80 divisors (see below), whose sum is σ = 61797120. Its totient is φ = 7581600.
The previous prime is 25122473. The next prime is 25122491. The reversal of 25122474 is 47422152.
It is a super-2 number, since 2×251224742 = 1262277399761352, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 4.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25122473) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 166299 + ... + 166449.
It is an arithmetic number, because the mean of its divisors is an integer number (772464).
Almost surely, 225122474 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25122474, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30898560).
25122474 is an abundant number, since it is smaller than the sum of its proper divisors (36674646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25122474 is a wasteful number, since it uses less digits than its factorization.
25122474 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257 (or 248 counting only the distinct ones).
The product of its digits is 4480, while the sum is 27.
The square root of 25122474 is about 5012.2324367491. The cubic root of 25122474 is about 292.8784844026.
The spelling of 25122474 in words is "twenty-five million, one hundred twenty-two thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •