Base | Representation |
---|---|
bin | 1011101011101010011110… |
… | …11001110111001011110000 |
3 | 10100221220011121220001020011 |
4 | 11311311033121313023300 |
5 | 11331344130040431242 |
6 | 130345335145224304 |
7 | 5261002353336106 |
oct | 565651731671360 |
9 | 110856147801204 |
10 | 25689531577072 |
11 | 820496193a0a0 |
12 | 2a6a978192094 |
13 | 1144687a7a42c |
14 | 64b54688dc76 |
15 | 2e839c5c4d17 |
hex | 175d4f6772f0 |
25689531577072 has 20 divisors (see below), whose sum is σ = 54298328106456. Its totient is φ = 11677059807680.
The previous prime is 25689531577063. The next prime is 25689531577147. The reversal of 25689531577072 is 27077513598652.
It is a junction number, because it is equal to n+sod(n) for n = 25689531576989 and 25689531577007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72981623623 + ... + 72981623974.
Almost surely, 225689531577072 is an apocalyptic number.
25689531577072 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
25689531577072 is an abundant number, since it is smaller than the sum of its proper divisors (28608796529384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25689531577072 is a wasteful number, since it uses less digits than its factorization.
25689531577072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145963247616 (or 145963247610 counting only the distinct ones).
The product of its (nonzero) digits is 222264000, while the sum is 67.
The spelling of 25689531577072 in words is "twenty-five trillion, six hundred eighty-nine billion, five hundred thirty-one million, five hundred seventy-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •