Search a number
-
+
1050151565039 is a prime number
BaseRepresentation
bin11110100100000011110…
…10010011011011101111
310201101121212102220020212
433102001322103123233
5114201202300040124
62122233304333035
7135604510010243
oct17220172233357
93641555386225
101050151565039
113754041aa005
1214b63977417b
137804b564905
1438b82d4c423
151c4b459940e
hexf481e936ef

1050151565039 has 2 divisors, whose sum is σ = 1050151565040. Its totient is φ = 1050151565038.

The previous prime is 1050151565011. The next prime is 1050151565053. The reversal of 1050151565039 is 9305651510501.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1050151565039 is a prime.

It is a super-3 number, since 3×10501515650393 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a congruent number.

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

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

Almost surely, 21050151565039 is an apocalyptic number.

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

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

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

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

The spelling of 1050151565039 in words is "one trillion, fifty billion, one hundred fifty-one million, five hundred sixty-five thousand, thirty-nine".