Search a number
-
+
1550099255041 is a prime number
BaseRepresentation
bin10110100011101001000…
…111011000111100000001
312111012002002012222200001
4112203221013120330001
5200344100402130131
63144034502400001
7216663622161421
oct26435107307401
95435062188601
101550099255041
115484366891a7
12210505130001
13b32348c8a0c
145504d236481
152a4c57e8261
hex168e91d8f01

1550099255041 has 2 divisors, whose sum is σ = 1550099255042. Its totient is φ = 1550099255040.

The previous prime is 1550099255039. The next prime is 1550099255053. The reversal of 1550099255041 is 1405529900551.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 842824983025 + 707274272016 = 918055^2 + 840996^2 .

It is a cyclic number.

It is not a de Polignac number, because 1550099255041 - 21 = 1550099255039 is a prime.

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

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

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

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

Almost surely, 21550099255041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 405000, while the sum is 46.

The spelling of 1550099255041 in words is "one trillion, five hundred fifty billion, ninety-nine million, two hundred fifty-five thousand, forty-one".