Search a number
-
+
504114651056131 is a prime number
BaseRepresentation
bin111001010011111010101011…
…0101100111100100000000011
32110002220220000210110110021221
41302213311112230330200003
51012033403301132244011
64544055023521455511
7211120040000030623
oct16247652654744003
92402826023413257
10504114651056131
11136698906308895
12486589687a1597
1318839a6644162b
148c6b3ca56a883
153d432a3e7b971
hex1ca7d56b3c803

504114651056131 has 2 divisors, whose sum is σ = 504114651056132. Its totient is φ = 504114651056130.

The previous prime is 504114651056129. The next prime is 504114651056141. The reversal of 504114651056131 is 131650156411405.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 504114651056131 - 21 = 504114651056129 is a prime.

It is a super-2 number, since 2×5041146510561312 (a number of 30 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2504114651056131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 216000, while the sum is 43.

The spelling of 504114651056131 in words is "five hundred four trillion, one hundred fourteen billion, six hundred fifty-one million, fifty-six thousand, one hundred thirty-one".