Search a number
-
+
5605101050051 is a prime number
BaseRepresentation
bin101000110010000101000…
…0011101001100011000011
3201211211202010111101002002
41101210022003221203003
51213313221332100201
615530540424014215
71115645425552166
oct121441203514303
921754663441062
105605101050051
1118711234664a8
1276638100136b
133187357a0a89
141554072b3add
159ac0530676b
hex5190a0e98c3

5605101050051 has 2 divisors, whose sum is σ = 5605101050052. Its totient is φ = 5605101050050.

The previous prime is 5605101050047. The next prime is 5605101050063. The reversal of 5605101050051 is 1500501015065.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 5605101050051 - 22 = 5605101050047 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 5605101049996 and 5605101050023.

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

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

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

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

Almost surely, 25605101050051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3750, while the sum is 29.

The spelling of 5605101050051 in words is "five trillion, six hundred five billion, one hundred one million, fifty thousand, fifty-one".