Search a number
-
+
1130230331969 is a prime number
BaseRepresentation
bin10000011100100110111…
…110100011101001000001
311000001022200202202011112
4100130212332203221001
5122004202431110334
62223115354253105
7144441106211114
oct20344676435101
94001280682145
101130230331969
113a6367614922
12163067a27195
1382770ab777b
143c9bc34c57b
151e5ee9264ce
hex10726fa3a41

1130230331969 has 2 divisors, whose sum is σ = 1130230331970. Its totient is φ = 1130230331968.

The previous prime is 1130230331947. The next prime is 1130230332013. The reversal of 1130230331969 is 9691330320311.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 591496351744 + 538733980225 = 769088^2 + 733985^2 .

It is a cyclic number.

It is not a de Polignac number, because 1130230331969 - 216 = 1130230266433 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 21130230331969 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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