Search a number
-
+
913282741369 is a prime number
BaseRepresentation
bin11010100101000111110…
…01001011010001111001
310020022100020121020221101
431102203321023101321
5104430400340210434
61535320054411401
7122660666134015
oct15224371132171
93208306536841
10913282741369
11322359330aa9
12129000660b61
13681785c519b
14322bb511545
1518b536cdb14
hexd4a3e4b479

913282741369 has 2 divisors, whose sum is σ = 913282741370. Its totient is φ = 913282741368.

The previous prime is 913282741337. The next prime is 913282741373. The reversal of 913282741369 is 963147282319.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 473773409344 + 439509332025 = 688312^2 + 662955^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 913282741369 - 25 = 913282741337 is a prime.

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

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

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

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

Almost surely, 2913282741369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3919104, while the sum is 55.

The spelling of 913282741369 in words is "nine hundred thirteen billion, two hundred eighty-two million, seven hundred forty-one thousand, three hundred sixty-nine".