Search a number
-
+
1095095231 is a prime number
BaseRepresentation
bin100000101000101…
…1101001110111111
32211022121121020122
41001101131032333
54220321021411
6300355405155
736065104316
oct10121351677
92738547218
101095095231
1151217528a
122668b37bb
13145b54359
14a562327d
15662179db
hex4145d3bf

1095095231 has 2 divisors, whose sum is σ = 1095095232. Its totient is φ = 1095095230.

The previous prime is 1095095213. The next prime is 1095095257. The reversal of 1095095231 is 1325905901.

Together with previous prime (1095095213) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1095095231 - 214 = 1095078847 is a prime.

It is a super-2 number, since 2×10950952312 = 2398467129917886722, which contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 21095095231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12150, while the sum is 35.

The square root of 1095095231 is about 33092.2231196395. The cubic root of 1095095231 is about 1030.7435580464.

The spelling of 1095095231 in words is "one billion, ninety-five million, ninety-five thousand, two hundred thirty-one".