Base | Representation |
---|---|
bin | 111100101011010101… |
… | …111000001110100100 |
3 | 20020011112100111122212 |
4 | 330223111320032210 |
5 | 2031412311240220 |
6 | 45532534142552 |
7 | 4464343005236 |
oct | 745325701644 |
9 | 206145314585 |
10 | 65151665060 |
11 | 256a3464299 |
12 | 107631b1a58 |
13 | 61b3b4b801 |
14 | 3220b54256 |
15 | 1a64b670c5 |
hex | f2b5783a4 |
65151665060 has 96 divisors (see below), whose sum is σ = 144088035840. Its totient is φ = 24712013312.
The previous prime is 65151665017. The next prime is 65151665069. The reversal of 65151665060 is 6056615156.
It is a junction number, because it is equal to n+sod(n) for n = 65151664999 and 65151665017.
It is not an unprimeable number, because it can be changed into a prime (65151665069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8324309 + ... + 8332131.
It is an arithmetic number, because the mean of its divisors is an integer number (1500917040).
Almost surely, 265151665060 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65151665060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72044017920).
65151665060 is an abundant number, since it is smaller than the sum of its proper divisors (78936370780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65151665060 is a wasteful number, since it uses less digits than its factorization.
65151665060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8117 (or 8115 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 65151665060 in words is "sixty-five billion, one hundred fifty-one million, six hundred sixty-five thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •