Search a number
-
+
368366492561 is a prime number
BaseRepresentation
bin1010101110001000101…
…10101001101110010001
31022012211002112200200012
411113010112221232101
522013403310230221
6441120352204305
735420315344544
oct5270426515621
91265732480605
10368366492561
11132250311021
125b485239695
1328976a0abc2
1413b86c2085b
1598ae6a265b
hex55c45a9b91

368366492561 has 2 divisors, whose sum is σ = 368366492562. Its totient is φ = 368366492560.

The previous prime is 368366492521. The next prime is 368366492597. The reversal of 368366492561 is 165294663863.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 359707259536 + 8659233025 = 599756^2 + 93055^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 2368366492561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 33592320, while the sum is 59.

The spelling of 368366492561 in words is "three hundred sixty-eight billion, three hundred sixty-six million, four hundred ninety-two thousand, five hundred sixty-one".