Search a number
-
+
95900068128367 is a prime number
BaseRepresentation
bin10101110011100001111001…
…011111101010011001101111
3110120112221211122011202122201
4111303201321133222121233
5100032211314420101432
6535543514425522331
726125360042220446
oct2563417137523157
9416487748152581
1095900068128367
1128613a99392348
12a90a0aa9433a7
1341684509a2729
141997833907d5d
15b148aa585ee7
hex5738797ea66f

95900068128367 has 2 divisors, whose sum is σ = 95900068128368. Its totient is φ = 95900068128366.

The previous prime is 95900068128323. The next prime is 95900068128407. The reversal of 95900068128367 is 76382186000959.

It is a strong prime.

It is an emirp because it is prime and its reverse (76382186000959) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 95900068128367 - 27 = 95900068128239 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 295900068128367 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 39191040, while the sum is 64.

The spelling of 95900068128367 in words is "ninety-five trillion, nine hundred billion, sixty-eight million, one hundred twenty-eight thousand, three hundred sixty-seven".