Base | Representation |
---|---|
bin | 11101110101100000011011… |
… | …01011111111110011101111 |
3 | 22121022021021011110201100111 |
4 | 32322300031223333303233 |
5 | 32044424041403113210 |
6 | 351312515320040451 |
7 | 16551114452522311 |
oct | 1672601553776357 |
9 | 277267234421314 |
10 | 65610150051055 |
11 | 199a6121283805 |
12 | 743782a603127 |
13 | 2a7c01a3a660c |
14 | 122b7963c57b1 |
15 | 78ba0d28e88a |
hex | 3bac0daffcef |
65610150051055 has 4 divisors (see below), whose sum is σ = 78732180061272. Its totient is φ = 52488120040840.
The previous prime is 65610150051031. The next prime is 65610150051109. The reversal of 65610150051055 is 55015005101656.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-65610150051055 is a prime.
It is a super-2 number, since 2×656101500510552 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 65610150050999 and 65610150051017.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6561015005101 + ... + 6561015005110.
It is an arithmetic number, because the mean of its divisors is an integer number (19683045015318).
Almost surely, 265610150051055 is an apocalyptic number.
65610150051055 is a deficient number, since it is larger than the sum of its proper divisors (13122030010217).
65610150051055 is a wasteful number, since it uses less digits than its factorization.
65610150051055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13122030010216.
The product of its (nonzero) digits is 112500, while the sum is 40.
The spelling of 65610150051055 in words is "sixty-five trillion, six hundred ten billion, one hundred fifty million, fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •