Search a number
-
+
742964794261 is a prime number
BaseRepresentation
bin10101100111111000010…
…01110001001110010101
32122000201111100002101021
422303330021301032111
544133042441404021
61325151402001141
7104451234360244
oct12637411611625
92560644302337
10742964794261
112670a9291528
12bbba94a61b1
13550a4828421
1427d6155295b
15144d5ecbc41
hexacfc271395

742964794261 has 2 divisors, whose sum is σ = 742964794262. Its totient is φ = 742964794260.

The previous prime is 742964794223. The next prime is 742964794291. The reversal of 742964794261 is 162497469247.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 723020293636 + 19944500625 = 850306^2 + 141225^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-742964794261 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 742964794261.

It is a congruent number.

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

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

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

Almost surely, 2742964794261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 36578304, while the sum is 61.

The spelling of 742964794261 in words is "seven hundred forty-two billion, nine hundred sixty-four million, seven hundred ninety-four thousand, two hundred sixty-one".