Search a number
-
+
1130302109957 is a prime number
BaseRepresentation
bin10000011100101011010…
…000010111100100000101
311000001111200211110001112
4100130223100113210011
5122004324320004312
62223130440534405
7144442640261306
oct20345320274405
94001450743045
101130302109957
113a63a408a779
12163087a81405
1382782929657
143c9c7ab47ad
151e605da3d22
hex1072b417905

1130302109957 has 2 divisors, whose sum is σ = 1130302109958. Its totient is φ = 1130302109956.

The previous prime is 1130302109929. The next prime is 1130302110107. The reversal of 1130302109957 is 7599012030311.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 792329636641 + 337972473316 = 890129^2 + 581354^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×11303021099572 (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 (1130302109257) 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, 565151054978 + 565151054979.

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

Almost surely, 21130302109957 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1130302109957 in words is "one trillion, one hundred thirty billion, three hundred two million, one hundred nine thousand, nine hundred fifty-seven".