Search a number
-
+
1050155451997 is a prime number
BaseRepresentation
bin11110100100000100010…
…01001000011001011101
310201101122010202101011021
433102002021020121131
5114201204243430442
62122233523524141
7135604555026421
oct17220211103135
93641563671137
101050155451997
11375406414373
1214b63ab29651
137804c2c5ba2
1438b83680b81
151c4b4ab5e67
hexf48224865d

1050155451997 has 2 divisors, whose sum is σ = 1050155451998. Its totient is φ = 1050155451996.

The previous prime is 1050155451977. The next prime is 1050155452063. The reversal of 1050155451997 is 7991545510501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1046731563801 + 3423888196 = 1023099^2 + 58514^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 21050155451997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1417500, while the sum is 52.

The spelling of 1050155451997 in words is "one trillion, fifty billion, one hundred fifty-five million, four hundred fifty-one thousand, nine hundred ninety-seven".