Search a number
-
+
10956730234189 is a prime number
BaseRepresentation
bin1001111101110001000000…
…0000110111010101001101
31102210110020100221211100111
42133130100000313111031
52414003340414443224
635145241414200021
72210411663222515
oct237342000672515
942713210854314
1010956730234189
1135447a5637483
12128b5a2953011
136162a4b16c2c
1429c446a1c845
15140022ae2d94
hex9f71003754d

10956730234189 has 2 divisors, whose sum is σ = 10956730234190. Its totient is φ = 10956730234188.

The previous prime is 10956730234139. The next prime is 10956730234259. The reversal of 10956730234189 is 98143203765901.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10941044675625 + 15685558564 = 3307725^2 + 125242^2 .

It is a cyclic number.

It is not a de Polignac number, because 10956730234189 - 215 = 10956730201421 is a prime.

It is a congruent number.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅10956730234189 = 21913460468378 is not.

Almost surely, 210956730234189 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9797760, while the sum is 58.

The spelling of 10956730234189 in words is "ten trillion, nine hundred fifty-six billion, seven hundred thirty million, two hundred thirty-four thousand, one hundred eighty-nine".