Search a number
-
+
5495168152561 is a prime number
BaseRepresentation
bin100111111110111000110…
…0010111011001111110001
3201110022222201100120001011
41033331301202323033301
51210013101021340221
615404240112310521
71105004250416653
oct117756142731761
921408881316034
105495168152561
11182954018850a
12749000842441
1330b2661698c9
1414dd78d9a6d3
1597e1e0661e1
hex4ff718bb3f1

5495168152561 has 2 divisors, whose sum is σ = 5495168152562. Its totient is φ = 5495168152560.

The previous prime is 5495168152559. The next prime is 5495168152631. The reversal of 5495168152561 is 1652518615945.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4635542486961 + 859625665600 = 2153031^2 + 927160^2 .

It is a cyclic number.

It is not a de Polignac number, because 5495168152561 - 21 = 5495168152559 is a prime.

Together with 5495168152559, it forms a pair of twin primes.

It is a junction number, because it is equal to n+sod(n) for n = 5495168152496 and 5495168152505.

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

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

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

Almost surely, 25495168152561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 12960000, while the sum is 58.

The spelling of 5495168152561 in words is "five trillion, four hundred ninety-five billion, one hundred sixty-eight million, one hundred fifty-two thousand, five hundred sixty-one".