Search a number
-
+
5106005601065 = 55441187686293
BaseRepresentation
bin100101001001101010110…
…1001100110101100101001
3200002010111022100121112222
41022103111221212230221
51132124044413213230
614505355552243425
71034616402334505
oct112232551465451
920063438317488
105106005601065
111699499059626
126a56b2b40575
132b0656b80cb5
141391bc273305
158cc43ced6e5
hex4a4d5a66b29

5106005601065 has 8 divisors (see below), whose sum is σ = 6128332871688. Its totient is φ = 4084053713920.

The previous prime is 5106005601049. The next prime is 5106005601071. The reversal of 5106005601065 is 5601065006015.

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

It can be written as a sum of positive squares in 4 ways, for example, as 882553150249 + 4223452450816 = 939443^2 + 2055104^2 .

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

It is not a de Polignac number, because 5106005601065 - 24 = 5106005601049 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is an unprimeable number.

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

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

Almost surely, 25106005601065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 187691739.

The product of its (nonzero) digits is 27000, while the sum is 35.

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

Divisors: 1 5 5441 27205 187686293 938431465 1021201120213 5106005601065