Search a number
-
+
505010034613067 is a prime number
BaseRepresentation
bin111001011010011011100111…
…1101110001001101101001011
32110020002111011121120221011112
41302310313033232021231023
51012143041022330104232
64550022223534520535
7211241525303502524
oct16264671756115513
92406074147527145
10505010034613067
11136a03609a55685
12487823b296614b
13188a331b674009
148c9c88a7b584b
153d5b70b0684b2
hex1cb4dcfb89b4b

505010034613067 has 2 divisors, whose sum is σ = 505010034613068. Its totient is φ = 505010034613066.

The previous prime is 505010034613057. The next prime is 505010034613153. The reversal of 505010034613067 is 760316430010505.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 505010034613067 - 230 = 505008960871243 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2505010034613067 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 226800, while the sum is 41.

The spelling of 505010034613067 in words is "five hundred five trillion, ten billion, thirty-four million, six hundred thirteen thousand, sixty-seven".