Search a number
-
+
1050151657297 is a prime number
BaseRepresentation
bin11110100100000011110…
…10101001111101010001
310201101121212121120210211
433102001322221331101
5114201202311013142
62122233310324121
7135604510543231
oct17220172517521
93641555546724
101050151657297
11375404262356
1214b6397b9641
137804b5978c2
1438b82d73cc1
151c4b45b6917
hexf481ea9f51

1050151657297 has 2 divisors, whose sum is σ = 1050151657298. Its totient is φ = 1050151657296.

The previous prime is 1050151657273. The next prime is 1050151657309. The reversal of 1050151657297 is 7927561510501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 665870688081 + 384280969216 = 816009^2 + 619904^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1050151657297 - 223 = 1050143268689 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (1050151657237) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525075828648 + 525075828649.

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

Almost surely, 21050151657297 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 661500, while the sum is 49.

The spelling of 1050151657297 in words is "one trillion, fifty billion, one hundred fifty-one million, six hundred fifty-seven thousand, two hundred ninety-seven".