Base | Representation |
---|---|
bin | 11101100110110110100101… |
… | …01111111101110011100010 |
3 | 22112112010122101102010210120 |
4 | 32303123102233331303202 |
5 | 32013201404403441200 |
6 | 350245325423541110 |
7 | 16466541324320232 |
oct | 1663332257756342 |
9 | 275463571363716 |
10 | 65106650062050 |
11 | 198216366a6813 |
12 | 737613145a796 |
13 | 2a436b90c423c |
14 | 1211270407cc2 |
15 | 77d8902529a0 |
hex | 3b36d2bfdce2 |
65106650062050 has 24 divisors (see below), whose sum is σ = 161464492154256. Its totient is φ = 17361773349840.
The previous prime is 65106650061953. The next prime is 65106650062099. The reversal of 65106650062050 is 5026005660156.
It is a junction number, because it is equal to n+sod(n) for n = 65106650061993 and 65106650062011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 217022166724 + ... + 217022167023.
It is an arithmetic number, because the mean of its divisors is an integer number (6727687173094).
Almost surely, 265106650062050 is an apocalyptic number.
65106650062050 is an abundant number, since it is smaller than the sum of its proper divisors (96357842092206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65106650062050 is a wasteful number, since it uses less digits than its factorization.
65106650062050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434044333762 (or 434044333757 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 42.
The spelling of 65106650062050 in words is "sixty-five trillion, one hundred six billion, six hundred fifty million, sixty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •