Search a number
-
+
11585683034621 is a prime number
BaseRepresentation
bin1010100010011000000010…
…0001011001000111111101
31112000120200011121112110122
42220212000201121013331
53004304434324101441
640350220031344325
72304016011633443
oct250460041310775
945016604545418
1011585683034621
113767508042513
1213714719820a5
136606a9bb47c7
142c0a701d4b93
1515158468334b
hexa89808591fd

11585683034621 has 2 divisors, whose sum is σ = 11585683034622. Its totient is φ = 11585683034620.

The previous prime is 11585683034609. The next prime is 11585683034711. The reversal of 11585683034621 is 12643038658511.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9771438364900 + 1814244669721 = 3125930^2 + 1346939^2 .

It is a cyclic number.

It is not a de Polignac number, because 11585683034621 - 26 = 11585683034557 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 211585683034621 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4147200, while the sum is 53.

The spelling of 11585683034621 in words is "eleven trillion, five hundred eighty-five billion, six hundred eighty-three million, thirty-four thousand, six hundred twenty-one".