Search a number
-
+
10510056050051 is a prime number
BaseRepresentation
bin1001100011110001000000…
…1010000100110110000011
31101012202021212200020102002
42120330100022010312003
52334144043322100201
634204130400214215
72133216662262065
oct230742012046603
941182255606362
1010510056050051
113392320709788
121218b0460a36b
135b312b78986c
14284991b05735
151335cd80676b
hex98f10284d83

10510056050051 has 2 divisors, whose sum is σ = 10510056050052. Its totient is φ = 10510056050050.

The previous prime is 10510056050023. The next prime is 10510056050069. The reversal of 10510056050051 is 15005065001501.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10510056050051 - 214 = 10510056033667 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (10510056050251) 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, 5255028025025 + 5255028025026.

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

Almost surely, 210510056050051 is an apocalyptic number.

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

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

10510056050051 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 10510056050051 in words is "ten trillion, five hundred ten billion, fifty-six million, fifty thousand, fifty-one".