Base | Representation |
---|---|
bin | 11101100101001101001011… |
… | …10000100010000101110001 |
3 | 22112022201120120110201101212 |
4 | 32302212211300202011301 |
5 | 32011240011012123410 |
6 | 350203330232405505 |
7 | 16462466100333062 |
oct | 1662464560420561 |
9 | 275281516421355 |
10 | 65050060661105 |
11 | 197aa637434263 |
12 | 7367179846895 |
13 | 2a3b26b131300 |
14 | 120c6228c0569 |
15 | 77c17c14cb05 |
hex | 3b29a5c22171 |
65050060661105 has 48 divisors (see below), whose sum is σ = 85788918950256. Its totient is φ = 47321181573120.
The previous prime is 65050060661101. The next prime is 65050060661147. The reversal of 65050060661105 is 50116606005056.
It can be written as a sum of positive squares in 24 ways, for example, as 43825869652321 + 21224191008784 = 6620111^2 + 4606972^2 .
It is not a de Polignac number, because 65050060661105 - 22 = 65050060661101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (65050060661101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 50001149 + ... + 51285621.
It is an arithmetic number, because the mean of its divisors is an integer number (1787269144797).
Almost surely, 265050060661105 is an apocalyptic number.
65050060661105 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
65050060661105 is a deficient number, since it is larger than the sum of its proper divisors (20738858289151).
65050060661105 is a wasteful number, since it uses less digits than its factorization.
65050060661105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1285398 (or 1285385 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 65050060661105 in words is "sixty-five trillion, fifty billion, sixty million, six hundred sixty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •