Search a number
-
+
913636914061 is a prime number
BaseRepresentation
bin11010100101110010000…
…00001111001110001101
310020100020221001002112111
431102321000033032031
5104432112022222221
61535415145504021
7123002526430324
oct15227100171615
93210227032474
10913636914061
11322520246203
1212909b1a2011
1368203aac721
14323125870bb
1518b7483dbe1
hexd4b900f38d

913636914061 has 2 divisors, whose sum is σ = 913636914062. Its totient is φ = 913636914060.

The previous prime is 913636914041. The next prime is 913636914109. The reversal of 913636914061 is 160419636319.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 721327476100 + 192309437961 = 849310^2 + 438531^2 .

It is a cyclic number.

It is not a de Polignac number, because 913636914061 - 221 = 913634816909 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (913636914041) 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, 456818457030 + 456818457031.

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

Almost surely, 2913636914061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 629856, while the sum is 49.

The spelling of 913636914061 in words is "nine hundred thirteen billion, six hundred thirty-six million, nine hundred fourteen thousand, sixty-one".