Search a number
-
+
390925915169 is a prime number
BaseRepresentation
bin1011011000001010000…
…00000001010000100001
31101101001022002002200212
411230011000001100201
522401104013241134
6455331111023505
740146336311126
oct5540500012041
91341038062625
10390925915169
11140877540139
126392036ab95
132ab3071c18a
1414cc6dc474d
15a27ee85bce
hex5b05001421

390925915169 has 2 divisors, whose sum is σ = 390925915170. Its totient is φ = 390925915168.

The previous prime is 390925915123. The next prime is 390925915181. The reversal of 390925915169 is 961519529093.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 390516257569 + 409657600 = 624913^2 + 20240^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 2390925915169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5904900, while the sum is 59.

The spelling of 390925915169 in words is "three hundred ninety billion, nine hundred twenty-five million, nine hundred fifteen thousand, one hundred sixty-nine".