Search a number
-
+
5105606655051 = 32781041375477
BaseRepresentation
bin100101001001011110111…
…0111101111110001001011
3200002002110111200001111200
41022102331313233301023
51132122240300430201
614505252221355243
71034603456342550
oct112227567576113
920062414601450
105105606655051
111699303943581
126a5601408b23
132b05c231b376
141391812a4a27
158cc1dc97386
hex4a4bddefc4b

5105606655051 has 12 divisors (see below), whose sum is σ = 8428303049712. Its totient is φ = 2917489517136.

The previous prime is 5105606655049. The next prime is 5105606655133. The reversal of 5105606655051 is 1505566065015.

It is not a de Polignac number, because 5105606655051 - 21 = 5105606655049 is a prime.

It is a super-2 number, since 2×51056066550512 (a number of 26 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 5105606654988 and 5105606655006.

It is not an unprimeable number, because it can be changed into a prime (5105606655011) by changing a digit.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40520687676 + ... + 40520687801.

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

Almost surely, 25105606655051 is an apocalyptic number.

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

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

5105606655051 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 81041375490 (or 81041375487 counting only the distinct ones).

The product of its (nonzero) digits is 675000, while the sum is 45.

The spelling of 5105606655051 in words is "five trillion, one hundred five billion, six hundred six million, six hundred fifty-five thousand, fifty-one".

Divisors: 1 3 7 9 21 63 81041375477 243124126431 567289628339 729372379293 1701868885017 5105606655051