Base | Representation |
---|---|
bin | 11101101110010001111000… |
… | …10111010011111101101000 |
3 | 22120102112021222011212002101 |
4 | 32313020330113103331220 |
5 | 32031342004203221233 |
6 | 351002450301343144 |
7 | 16524143646055600 |
oct | 1667107427237550 |
9 | 276375258155071 |
10 | 65361825054568 |
11 | 1990a88129a489 |
12 | 73b7686b67ab4 |
13 | 2a61794351583 |
14 | 121d75a22dc00 |
15 | 78532753cc7d |
hex | 3b723c5d3f68 |
65361825054568 has 192 divisors, whose sum is σ = 151487301081600. Its totient is φ = 26270432133120.
The previous prime is 65361825054497. The next prime is 65361825054599. The reversal of 65361825054568 is 86545052816356.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2205695880 + ... + 2205725512.
It is an arithmetic number, because the mean of its divisors is an integer number (788996359800).
Almost surely, 265361825054568 is an apocalyptic number.
65361825054568 is a gapful number since it is divisible by the number (68) 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 65361825054568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75743650540800).
65361825054568 is an abundant number, since it is smaller than the sum of its proper divisors (86125476027032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65361825054568 is a wasteful number, since it uses less digits than its factorization.
65361825054568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30840 (or 30829 counting only the distinct ones).
The product of its (nonzero) digits is 207360000, while the sum is 64.
The spelling of 65361825054568 in words is "sixty-five trillion, three hundred sixty-one billion, eight hundred twenty-five million, fifty-four thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •