Search a number
-
+
55606065011565 = 353707071000771
BaseRepresentation
bin11001010010010110010111…
…10000001001101101101101
321021212212222021111221211020
430221023023300021231231
524242022210120332230
6314133023522244353
714466256061655615
oct1451131360115555
9237785867457736
1055606065011565
11167994440630a2
1262a09b27b66b9
132504824b23583
14da34c2927a45
156666948c9810
hex3292cbc09b6d

55606065011565 has 8 divisors (see below), whose sum is σ = 88969704018528. Its totient is φ = 29656568006160.

The previous prime is 55606065011501. The next prime is 55606065011597. The reversal of 55606065011565 is 56511056060655.

55606065011565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 55606065011565 - 26 = 55606065011501 is a prime.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1853535500371 + ... + 1853535500400.

It is an arithmetic number, because the mean of its divisors is an integer number (11121213002316).

Almost surely, 255606065011565 is an apocalyptic number.

It is an amenable number.

55606065011565 is a deficient number, since it is larger than the sum of its proper divisors (33363639006963).

55606065011565 is a wasteful number, since it uses less digits than its factorization.

55606065011565 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 3707071000779.

The product of its (nonzero) digits is 4050000, while the sum is 51.

The spelling of 55606065011565 in words is "fifty-five trillion, six hundred six billion, sixty-five million, eleven thousand, five hundred sixty-five".

Divisors: 1 3 5 15 3707071000771 11121213002313 18535355003855 55606065011565