Search a number
-
+
5101100510761 is a prime number
BaseRepresentation
bin100101000111011000101…
…0010001010111000101001
3200001122211110120012121201
41022032301102022320221
51132034023212321021
614503225131204201
71034354011631623
oct112166122127051
920048743505551
105101100510761
111697401286692
126a47642a6661
132b00548a2cb8
14138c74a39c13
158ca58393591
hex4a3b148ae29

5101100510761 has 2 divisors, whose sum is σ = 5101100510762. Its totient is φ = 5101100510760.

The previous prime is 5101100510741. The next prime is 5101100510783. The reversal of 5101100510761 is 1670150011015.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4577567225625 + 523533285136 = 2139525^2 + 723556^2 .

It is a cyclic number.

It is not a de Polignac number, because 5101100510761 - 223 = 5101092122153 is a prime.

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

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

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

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

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

Almost surely, 25101100510761 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1050, while the sum is 28.

Adding to 5101100510761 its reverse (1670150011015), we get a palindrome (6771250521776).

The spelling of 5101100510761 in words is "five trillion, one hundred one billion, one hundred million, five hundred ten thousand, seven hundred sixty-one".