Search a number
-
+
1550366005439 is a prime number
BaseRepresentation
bin10110100011111001000…
…000111101100010111111
312111012202200011022102102
4112203321000331202333
5200400122144133224
63144121152015315
7220003341416366
oct26437100754277
95435680138372
101550366005439
11548563212779
1221057a53153b
13b3277c546a4
14550768327dd
152a4dde3a4ae
hex168f903d8bf

1550366005439 has 2 divisors, whose sum is σ = 1550366005440. Its totient is φ = 1550366005438.

The previous prime is 1550366005367. The next prime is 1550366005459. The reversal of 1550366005439 is 9345006630551.

It is a happy number.

It is a strong prime.

It is an emirp because it is prime and its reverse (9345006630551) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1550366005439 is a prime.

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 1550366005393 and 1550366005402.

It is a congruent number.

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

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

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

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

Almost surely, 21550366005439 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1458000, while the sum is 47.

The spelling of 1550366005439 in words is "one trillion, five hundred fifty billion, three hundred sixty-six million, five thousand, four hundred thirty-nine".