Search a number
-
+
13550051 = 34333947
BaseRepresentation
bin110011101100…
…000111100011
3221111102011202
4303230013203
511432100201
61202231415
7223113344
oct63540743
927442152
1013550051
117715399
12465556b
132a656a8
141b2a0cb
1512c9c6b
hexcec1e3

13550051 has 4 divisors (see below), whose sum is σ = 13557432. Its totient is φ = 13542672.

The previous prime is 13550039. The next prime is 13550057. The reversal of 13550051 is 15005531.

It is a happy number.

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 a de Polignac number, because none of the positive numbers 2k-13550051 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 213550051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 7380.

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

The square root of 13550051 is about 3681.0393912589. The cubic root of 13550051 is about 238.4040578844.

Adding to 13550051 its reverse (15005531), we get a palindrome (28555582).

The spelling of 13550051 in words is "thirteen million, five hundred fifty thousand, fifty-one".

Divisors: 1 3433 3947 13550051