Base | Representation |
---|---|
bin | 111100100111011010… |
… | …010011110110110110 |
3 | 20012222221021001020000 |
4 | 330213122103312312 |
5 | 2031243420433232 |
6 | 45522220452130 |
7 | 4462612321500 |
oct | 744732236666 |
9 | 205887231200 |
10 | 65085717942 |
11 | 2566a211243 |
12 | 107450aa046 |
13 | 61a329b94b |
14 | 32160a8d70 |
15 | 1a5de8c27c |
hex | f27693db6 |
65085717942 has 240 divisors, whose sum is σ = 175507683120. Its totient is φ = 17964955008.
The previous prime is 65085717901. The next prime is 65085717947. The reversal of 65085717942 is 24971758056.
65085717942 is a `hidden beast` number, since 65 + 0 + 8 + 571 + 7 + 9 + 4 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65085717947) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 28186684 + ... + 28188992.
It is an arithmetic number, because the mean of its divisors is an integer number (731282013).
Almost surely, 265085717942 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65085717942, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87753841560).
65085717942 is an abundant number, since it is smaller than the sum of its proper divisors (110421965178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65085717942 is a wasteful number, since it uses less digits than its factorization.
65085717942 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2457 (or 2441 counting only the distinct ones).
The product of its (nonzero) digits is 4233600, while the sum is 54.
The spelling of 65085717942 in words is "sixty-five billion, eighty-five million, seven hundred seventeen thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •