Search a number
-
+
196115043231769 is a prime number
BaseRepresentation
bin101100100101110110010111…
…011111001010100000011001
3221201101102012120002001102011
4230211312113133022200121
5201201122102031404034
61533034001311105521
756210562410534434
oct5445662737124031
9851342176061364
10196115043231769
1157540a17217532
1219bb44ab2122a1
13855775277776c
1436600395c081b
1517a1607d22864
hexb25d977ca819

196115043231769 has 2 divisors, whose sum is σ = 196115043231770. Its totient is φ = 196115043231768.

The previous prime is 196115043231721. The next prime is 196115043231773. The reversal of 196115043231769 is 967132340511691.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 169987488305625 + 26127554926144 = 13037925^2 + 5111512^2 .

It is a cyclic number.

It is not a de Polignac number, because 196115043231769 - 27 = 196115043231641 is a prime.

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

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

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

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

Almost surely, 2196115043231769 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 196115043231769 in words is "one hundred ninety-six trillion, one hundred fifteen billion, forty-three million, two hundred thirty-one thousand, seven hundred sixty-nine".