Search a number
-
+
1158981094969 is a prime number
BaseRepresentation
bin10000110111011000101…
…010000000111000111001
311002210112101101211112121
4100313120222000320321
5122442043130014334
62244232323041241
7146506426522435
oct20673052007071
94083471354477
101158981094969
11407580682685
12168750510221
13853a3409379
14401488cb9c5
1520233a3adb4
hex10dd8a80e39

1158981094969 has 2 divisors, whose sum is σ = 1158981094970. Its totient is φ = 1158981094968.

The previous prime is 1158981094963. The next prime is 1158981094991. The reversal of 1158981094969 is 9694901898511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 824850853369 + 334130241600 = 908213^2 + 578040^2 .

It is a cyclic number.

It is not a de Polignac number, because 1158981094969 - 27 = 1158981094841 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1158981094898 and 1158981094907.

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

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

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

Almost surely, 21158981094969 is an apocalyptic number.

It is an amenable number.

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

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

1158981094969 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 50388480, while the sum is 70.

The spelling of 1158981094969 in words is "one trillion, one hundred fifty-eight billion, nine hundred eighty-one million, ninety-four thousand, nine hundred sixty-nine".