Search a number
-
+
1000050600559 is a prime number
BaseRepresentation
bin11101000110101111010…
…10010010101001101111
310112121022020122012101211
432203113222102221233
5112341100423204214
62043230015015251
7132152120564353
oct16432752225157
93477266565354
101000050600559
1135613454693a
12141996b0a527
13733c59043ba
143658d059463
151b030e0e0c4
hexe8d7a92a6f

1000050600559 has 2 divisors, whose sum is σ = 1000050600560. Its totient is φ = 1000050600558.

The previous prime is 1000050600557. The next prime is 1000050600569. The reversal of 1000050600559 is 9550060500001.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1000050600559 - 21 = 1000050600557 is a prime.

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

Together with 1000050600557, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 1000050600559.

It is a congruent number.

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

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

Almost surely, 21000050600559 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6750, while the sum is 31.

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