Base | Representation |
---|---|
bin | 1011100100011110100110… |
… | …11010001000001100000110 |
3 | 10100002021220012022201220120 |
4 | 11302033103122020030012 |
5 | 11313323010330323240 |
6 | 130040104150042410 |
7 | 5234112201612501 |
oct | 562172332101406 |
9 | 110067805281816 |
10 | 25442638136070 |
11 | 811a186a37681 |
12 | 2a2ab54049406 |
13 | 11272cc4a1b3c |
14 | 63d6048a2138 |
15 | 2e1c4c39cad0 |
hex | 1723d3688306 |
25442638136070 has 256 divisors, whose sum is σ = 67987153059840. Its totient is φ = 6060769228800.
The previous prime is 25442638136059. The next prime is 25442638136077. The reversal of 25442638136070 is 7063183624452.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25442638136077) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4550638975 + ... + 4550644565.
It is an arithmetic number, because the mean of its divisors is an integer number (265574816640).
Almost surely, 225442638136070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25442638136070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33993576529920).
25442638136070 is an abundant number, since it is smaller than the sum of its proper divisors (42544514923770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25442638136070 is a wasteful number, since it uses less digits than its factorization.
25442638136070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8571.
The product of its (nonzero) digits is 5806080, while the sum is 51.
The spelling of 25442638136070 in words is "twenty-five trillion, four hundred forty-two billion, six hundred thirty-eight million, one hundred thirty-six thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •