Search a number
-
+
2555505250013 is a prime number
BaseRepresentation
bin100101001011111111111…
…110111000111011011101
3100001022012112222102010002
4211023333332320323131
5313332133321000023
65233552150224045
7352425542135642
oct45137776707335
910038175872102
102555505250013
118a5869101131
12353335655025
13156ca1b83341
148b989625dc9
154671b960b28
hex252fffb8edd

2555505250013 has 2 divisors, whose sum is σ = 2555505250014. Its totient is φ = 2555505250012.

The previous prime is 2555505249991. The next prime is 2555505250031. The reversal of 2555505250013 is 3100525055552.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2555387679364 + 117570649 = 1598558^2 + 10843^2 .

It is a cyclic number.

It is not a de Polignac number, because 2555505250013 - 218 = 2555504987869 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 22555505250013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 187500, while the sum is 38.

The spelling of 2555505250013 in words is "two trillion, five hundred fifty-five billion, five hundred five million, two hundred fifty thousand, thirteen".