Search a number
-
+
5530250005565 = 51106050001113
BaseRepresentation
bin101000001111001110010…
…0101100100110000111101
3201120200112122001100012012
41100132130211210300331
51211101423000134230
615432321202221005
71110355515304535
oct120363445446075
921520478040165
105530250005565
111842402a5595a
12753971654765
1331166731c1cc
141519462d24c5
1598cc3db4395
hex5079c964c3d

5530250005565 has 4 divisors (see below), whose sum is σ = 6636300006684. Its totient is φ = 4424200004448.

The previous prime is 5530250005561. The next prime is 5530250005571. The reversal of 5530250005565 is 5655000520355.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 1333697000164 + 4196553005401 = 1154858^2 + 2048549^2 .

It is a cyclic number.

It is not a de Polignac number, because 5530250005565 - 22 = 5530250005561 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 553025000552 + ... + 553025000561.

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

Almost surely, 25530250005565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1106050001118.

The product of its (nonzero) digits is 562500, while the sum is 41.

The spelling of 5530250005565 in words is "five trillion, five hundred thirty billion, two hundred fifty million, five thousand, five hundred sixty-five".

Divisors: 1 5 1106050001113 5530250005565