Search a number
-
+
395415561601 is a prime number
BaseRepresentation
bin1011100000100001001…
…10101010010110000001
31101210122012010202210001
411300100212222112001
522434302340432401
6501352411440001
740365523550254
oct5602046522601
91353565122701
10395415561601
11142770859a35
1264773a56001
132b39790c1b8
14151d139709b
15a4441cb601
hex5c109aa581

395415561601 has 2 divisors, whose sum is σ = 395415561602. Its totient is φ = 395415561600.

The previous prime is 395415561571. The next prime is 395415561647. The reversal of 395415561601 is 106165514593.

It is an a-pointer prime, because the next prime (395415561647) can be obtained adding 395415561601 to its sum of digits (46).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 245143814400 + 150271747201 = 495120^2 + 387649^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 395415561601 - 27 = 395415561473 is a prime.

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

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

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

Almost surely, 2395415561601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486000, while the sum is 46.

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