Search a number
-
+
1550053111 = 2544760913
BaseRepresentation
bin101110001100011…
…1110111011110111
311000000200212010111
41130120332323313
511133303144421
6413451003451
753261143165
oct13430767367
94000625114
101550053111
11725a67932
12373139587
131b91988b9
14109c12235
1591134ee1
hex5c63eef7

1550053111 has 4 divisors (see below), whose sum is σ = 1550139472. Its totient is φ = 1549966752.

The previous prime is 1550053097. The next prime is 1550053123. The reversal of 1550053111 is 1113500551.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 1550053111 - 215 = 1550020343 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1550053171) 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, 5010 + ... + 55903.

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

Almost surely, 21550053111 is an apocalyptic number.

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

1550053111 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 86360.

The product of its (nonzero) digits is 375, while the sum is 22.

The square root of 1550053111 is about 39370.7138746556. The cubic root of 1550053111 is about 1157.3077454065.

Adding to 1550053111 its reverse (1113500551), we get a palindrome (2663553662).

The spelling of 1550053111 in words is "one billion, five hundred fifty million, fifty-three thousand, one hundred eleven".

Divisors: 1 25447 60913 1550053111