Search a number
-
+
10051429168013 is a prime number
BaseRepresentation
bin1001001001000100011111…
…0111010111001110001101
31022120220111101021200101212
42102101013313113032031
52304140311331334023
633213321322344205
72055122533144532
oct222210767271615
938526441250355
1010051429168013
1132258727a8162
12116404b35b065
1357bacc01a09c
1426a6c55a4d89
151266d9edee78
hex92447dd738d

10051429168013 has 2 divisors, whose sum is σ = 10051429168014. Its totient is φ = 10051429168012.

The previous prime is 10051429167943. The next prime is 10051429168069. The reversal of 10051429168013 is 31086192415001.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9892270459204 + 159158708809 = 3145198^2 + 398947^2 .

It is a cyclic number.

It is not a de Polignac number, because 10051429168013 - 212 = 10051429163917 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 210051429168013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10051429168013 in words is "ten trillion, fifty-one billion, four hundred twenty-nine million, one hundred sixty-eight thousand, thirteen".