Search a number
-
+
1151055332461 is a prime number
BaseRepresentation
bin10000110000000000001…
…111101000010001101101
311002001002000200101100001
4100300000033220101231
5122324330131114321
62240442034304301
7146106136615216
oct20600017502155
94061060611301
101151055332461
114041837aaa31
121670ba128091
138470c389778
143d9d602a40d
151ee1cd06c91
hex10c003e846d

1151055332461 has 2 divisors, whose sum is σ = 1151055332462. Its totient is φ = 1151055332460.

The previous prime is 1151055332407. The next prime is 1151055332477. The reversal of 1151055332461 is 1642335501511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 798538832100 + 352516500361 = 893610^2 + 593731^2 .

It is a cyclic number.

It is not a de Polignac number, because 1151055332461 - 29 = 1151055331949 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21151055332461 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54000, while the sum is 37.

The spelling of 1151055332461 in words is "one trillion, one hundred fifty-one billion, fifty-five million, three hundred thirty-two thousand, four hundred sixty-one".