Search a number
-
+
1156299095669 is a prime number
BaseRepresentation
bin10000110100111000110…
…010111111111001110101
311002112121110202011011012
4100310320302333321311
5122421100032030134
62243110234322005
7146353112100464
oct20647062777165
94075543664135
101156299095669
11406424770933
12168122289305
1385066886033
143dd726229db
152012835e6ce
hex10d38cbfe75

1156299095669 has 2 divisors, whose sum is σ = 1156299095670. Its totient is φ = 1156299095668.

The previous prime is 1156299095659. The next prime is 1156299095683. The reversal of 1156299095669 is 9665909926511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 952683363025 + 203615732644 = 976055^2 + 451238^2 .

It is a cyclic number.

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

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

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

It is a congruent number.

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

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

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

Almost surely, 21156299095669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70858800, while the sum is 68.

The spelling of 1156299095669 in words is "one trillion, one hundred fifty-six billion, two hundred ninety-nine million, ninety-five thousand, six hundred sixty-nine".