Search a number
-
+
1568949045497 is a prime number
BaseRepresentation
bin10110110101001100101…
…001101000100011111001
312112222201202102120001022
4112311030221220203321
5201201201423423442
63200433143032225
7221232006562631
oct26651451504371
95488652376038
101568949045497
11555429919819
122140a5a3b675
13b4c49bc3092
1455d1a86d6c1
152ac2a5b13d2
hex16d4ca688f9

1568949045497 has 2 divisors, whose sum is σ = 1568949045498. Its totient is φ = 1568949045496.

The previous prime is 1568949045403. The next prime is 1568949045527. The reversal of 1568949045497 is 7945409498651.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1371454130281 + 197494915216 = 1171091^2 + 444404^2 .

It is a cyclic number.

It is not a de Polignac number, because 1568949045497 - 222 = 1568944851193 is a prime.

It is a super-2 number, since 2×15689490454972 (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 1568949045497.

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

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

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

Almost surely, 21568949045497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 391910400, while the sum is 71.

The spelling of 1568949045497 in words is "one trillion, five hundred sixty-eight billion, nine hundred forty-nine million, forty-five thousand, four hundred ninety-seven".