Search a number
-
+
96874047869 is a prime number
BaseRepresentation
bin101101000111000100…
…1001010100101111101
3100021001022121112001212
41122032021022211331
53041344224012434
6112300415014205
76666425551304
oct1321611124575
9307038545055
1096874047869
11380a1968a95
1216936b0a365
13919acc9021
14498dc2d43b
1527beab68ce
hex168e24a97d

96874047869 has 2 divisors, whose sum is σ = 96874047870. Its totient is φ = 96874047868.

The previous prime is 96874047857. The next prime is 96874047877.

96874047869 is nontrivially palindromic in base 10.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 96599748025 + 274299844 = 310805^2 + 16562^2 .

It is a palprime.

It is a cyclic number.

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

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 296874047869 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 96874047869 in words is "ninety-six billion, eight hundred seventy-four million, forty-seven thousand, eight hundred sixty-nine".