Search a number
-
+
502257170490961 is a prime number
BaseRepresentation
bin111001000110011001101110…
…0001110111010011001010001
32102212100022112210002000221011
41302030303130032322121101
51011312440141121202321
64540113431522530521
7210535611620524114
oct16214633416723121
92385308483060834
10502257170490961
11136042084a19896
12483b897a206a41
13187338567147b2
148c0553bb7857b
153d0ecdce89ae1
hex1c8ccdc3ba651

502257170490961 has 2 divisors, whose sum is σ = 502257170490962. Its totient is φ = 502257170490960.

The previous prime is 502257170490937. The next prime is 502257170491049. The reversal of 502257170490961 is 169094071752205.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 434645608600336 + 67611561890625 = 20848156^2 + 8222625^2 .

It is a cyclic number.

It is not a de Polignac number, because 502257170490961 - 227 = 502257036273233 is a prime.

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

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

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

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

Almost surely, 2502257170490961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9525600, while the sum is 58.

The spelling of 502257170490961 in words is "five hundred two trillion, two hundred fifty-seven billion, one hundred seventy million, four hundred ninety thousand, nine hundred sixty-one".