Search a number
-
+
1050506110051 is a prime number
BaseRepresentation
bin11110100100101110000…
…10110010010001100011
310201102112120120122120121
433102113002302101203
5114202414031010201
62122332411421111
7135616343414206
oct17222702622143
93642476518517
101050506110051
11375576348a12
1214b718454797
13780a6b4c768
1438bb807d93d
151c4d577e9a1
hexf4970b2463

1050506110051 has 2 divisors, whose sum is σ = 1050506110052. Its totient is φ = 1050506110050.

The previous prime is 1050506110039. The next prime is 1050506110097. The reversal of 1050506110051 is 1500116050501.

It is a weak prime.

It is an emirp because it is prime and its reverse (1500116050501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1050506110051 - 29 = 1050506109539 is a prime.

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

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

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

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

Almost surely, 21050506110051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 750, while the sum is 25.

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