Base | Representation |
---|---|
bin | 111101001001101100… |
… | …010100100111110000 |
3 | 20021111000111112200012 |
4 | 331021230110213300 |
5 | 2033433140140013 |
6 | 50055244114052 |
7 | 4513065100214 |
oct | 751154244760 |
9 | 207430445605 |
10 | 65660865008 |
11 | 259349347a2 |
12 | 10885835928 |
13 | 62654a525b |
14 | 326c622944 |
15 | 1a946eb1a8 |
hex | f49b149f0 |
65660865008 has 80 divisors (see below), whose sum is σ = 136279563264. Its totient is φ = 30538583040.
The previous prime is 65660864999. The next prime is 65660865073. The reversal of 65660865008 is 80056806656.
65660865008 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×656608650082 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13589153 + ... + 13593983.
Almost surely, 265660865008 is an apocalyptic number.
65660865008 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 65660865008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68139781632).
65660865008 is an abundant number, since it is smaller than the sum of its proper divisors (70618698256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65660865008 is a wasteful number, since it uses less digits than its factorization.
65660865008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5430 (or 5424 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 50.
The spelling of 65660865008 in words is "sixty-five billion, six hundred sixty million, eight hundred sixty-five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •