Search a number
-
+
502257170491331 is a prime number
BaseRepresentation
bin111001000110011001101110…
…0001110111010011111000011
32102212100022112210002001102212
41302030303130032322133003
51011312440141121210311
64540113431522532335
7210535611620525153
oct16214633416723703
92385308483061385
10502257170491331
11136042084a1a0a2
12483b897a2070ab
1318733856714a08
148c0553bb78763
153d0ecdce89c8b
hex1c8ccdc3ba7c3

502257170491331 has 2 divisors, whose sum is σ = 502257170491332. Its totient is φ = 502257170491330.

The previous prime is 502257170491217. The next prime is 502257170491367. The reversal of 502257170491331 is 133194071752205.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 502257170491331 - 222 = 502257166297027 is a prime.

It is a super-2 number, since 2×5022571704913312 (a number of 30 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 502257170491331.

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

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

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

Almost surely, 2502257170491331 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1587600, while the sum is 50.

The spelling of 502257170491331 in words is "five hundred two trillion, two hundred fifty-seven billion, one hundred seventy million, four hundred ninety-one thousand, three hundred thirty-one".