Base | Representation |
---|---|
bin | 1011100001001010001110… |
… | …10101110100111100010000 |
3 | 10022200101121000021222011110 |
4 | 11300211013111310330100 |
5 | 11304441002434024340 |
6 | 125511450145213320 |
7 | 5222634535430301 |
oct | 560450725647420 |
9 | 108611530258143 |
10 | 25328619048720 |
11 | 8085897156779 |
12 | 2a10a33331240 |
13 | 111962b42c650 |
14 | 637ca99da7a8 |
15 | 2ddcc750e680 |
hex | 170947574f10 |
25328619048720 has 160 divisors (see below), whose sum is σ = 84615501261312. Its totient is φ = 6230543026176.
The previous prime is 25328619048661. The next prime is 25328619048739. The reversal of 25328619048720 is 2784091682352.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1909734 + ... + 7369146.
It is a 1-persistent number, because it is pandigital, but 2⋅25328619048720 = 50657238097440 is not.
Almost surely, 225328619048720 is an apocalyptic number.
25328619048720 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 25328619048720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42307750630656).
25328619048720 is an abundant number, since it is smaller than the sum of its proper divisors (59286882212592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25328619048720 is a wasteful number, since it uses less digits than its factorization.
25328619048720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5460929 (or 5460923 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 57.
The spelling of 25328619048720 in words is "twenty-five trillion, three hundred twenty-eight billion, six hundred nineteen million, forty-eight thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •