Base | Representation |
---|---|
bin | 111100100110001101… |
… | …010010100101100000 |
3 | 20012221112021021100100 |
4 | 330212031102211200 |
5 | 2031223233341043 |
6 | 45520220022400 |
7 | 4462245600612 |
oct | 744615224540 |
9 | 205845237310 |
10 | 65065527648 |
11 | 25659880a50 |
12 | 1073a391a00 |
13 | 619c04ca24 |
14 | 3213530db2 |
15 | 1a5c2eecd3 |
hex | f26352960 |
65065527648 has 72 divisors (see below), whose sum is σ = 201851021736. Its totient is φ = 19716825600.
The previous prime is 65065527641. The next prime is 65065527673. The reversal of 65065527648 is 84672556056.
65065527648 is a `hidden beast` number, since 6 + 50 + 6 + 5 + 527 + 64 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×650655276482 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 65065527594 and 65065527603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65065527641) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10266013 + ... + 10272348.
It is an arithmetic number, because the mean of its divisors is an integer number (2803486413).
Almost surely, 265065527648 is an apocalyptic number.
It is an amenable number.
65065527648 is an abundant number, since it is smaller than the sum of its proper divisors (136785494088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65065527648 is a wasteful number, since it uses less digits than its factorization.
65065527648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20538388 (or 20538377 counting only the distinct ones).
The product of its (nonzero) digits is 12096000, while the sum is 54.
The spelling of 65065527648 in words is "sixty-five billion, sixty-five million, five hundred twenty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •