Search a number
-
+
1158127306513 is a prime number
BaseRepresentation
bin10000110110100101110…
…001000100011100010001
311002201022212211212221221
4100312211301010130101
5122433321042302023
62244011503245041
7146446321452322
oct20664561043421
94081285755857
101158127306513
11407182743791
121685525a9781
13852985728b8
14400a7360449
15201d3adb85d
hex10da5c44711

1158127306513 has 2 divisors, whose sum is σ = 1158127306514. Its totient is φ = 1158127306512.

The previous prime is 1158127306471. The next prime is 1158127306547. The reversal of 1158127306513 is 3156037218511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 990934638849 + 167192667664 = 995457^2 + 408892^2 .

It is a cyclic number.

It is not a de Polignac number, because 1158127306513 - 229 = 1157590435601 is a prime.

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

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

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

Almost surely, 21158127306513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 151200, while the sum is 43.

The spelling of 1158127306513 in words is "one trillion, one hundred fifty-eight billion, one hundred twenty-seven million, three hundred six thousand, five hundred thirteen".