Search a number
-
+
55906099724569 is a prime number
BaseRepresentation
bin11001011011000101001110…
…01101110000000100011001
321022221120102012202120212011
430231202213031300010121
524311431143012141234
6314522524015345521
714530040160646333
oct1455424715600431
9238846365676764
1055906099724569
11168a4709909826
12632ab878222a1
132526bcbbb7403
14db3c26504453
1566e3a5143b64
hex32d8a7370119

55906099724569 has 2 divisors, whose sum is σ = 55906099724570. Its totient is φ = 55906099724568.

The previous prime is 55906099724561. The next prime is 55906099724669. The reversal of 55906099724569 is 96542799060955.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 34863356430400 + 21042743294169 = 5904520^2 + 4587237^2 .

It is a cyclic number.

It is not a de Polignac number, because 55906099724569 - 23 = 55906099724561 is a prime.

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

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

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

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

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

Almost surely, 255906099724569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1653372000, while the sum is 76.

The spelling of 55906099724569 in words is "fifty-five trillion, nine hundred six billion, ninety-nine million, seven hundred twenty-four thousand, five hundred sixty-nine".