Search a number
-
+
6550013 is a prime number
BaseRepresentation
bin11000111111000111111101
3110022202221002
4120333013331
53134100023
6352220045
7106450151
oct30770775
913282832
106550013
113774138
12223a625
131484462
14c27061
15895b28
hex63f1fd

6550013 has 2 divisors, whose sum is σ = 6550014. Its totient is φ = 6550012.

The previous prime is 6550007. The next prime is 6550031. The reversal of 6550013 is 3100556.

Together with next prime (6550031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5866084 + 683929 = 2422^2 + 827^2 .

It is a cyclic number.

It is not a de Polignac number, because 6550013 - 210 = 6548989 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (6550043) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3275006 + 3275007.

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

Almost surely, 26550013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 6550013 is about 2559.2993181728. The cubic root of 6550013 is about 187.1029869196.

Adding to 6550013 its reverse (3100556), we get a palindrome (9650569).

The spelling of 6550013 in words is "six million, five hundred fifty thousand, thirteen".