Search a number
-
+
1555089464987 is a prime number
BaseRepresentation
bin10110101000010010100…
…011100001111010011011
312111122221212011220210122
4112220102203201322123
5200434310400334422
63150222004103455
7220231365232442
oct26502243417233
95448855156718
101555089464987
1154a567509853
12211478394b8b
13b384b70a476
14553a3ca9d59
152a6b8968d42
hex16a128e1e9b

1555089464987 has 2 divisors, whose sum is σ = 1555089464988. Its totient is φ = 1555089464986.

The previous prime is 1555089464947. The next prime is 1555089464989. The reversal of 1555089464987 is 7894649805551.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1555089464987 - 212 = 1555089460891 is a prime.

It is a super-2 number, since 2×15550894649872 (a number of 25 digits) contains 22 as substring.

Together with 1555089464989, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1555089464987.

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

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

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

Almost surely, 21555089464987 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 435456000, while the sum is 71.

The spelling of 1555089464987 in words is "one trillion, five hundred fifty-five billion, eighty-nine million, four hundred sixty-four thousand, nine hundred eighty-seven".