Search a number
-
+
495115111 is a prime number
BaseRepresentation
bin11101100000101…
…101101101100111
31021111122110020201
4131200231231213
52003222140421
6121044011331
715161260201
oct3540555547
91244573221
10495115111
11234530347
12119990b47
137b76482a
1449a83771
152d700b91
hex1d82db67

495115111 has 2 divisors, whose sum is σ = 495115112. Its totient is φ = 495115110.

The previous prime is 495115109. The next prime is 495115133. The reversal of 495115111 is 111511594.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 495115111 - 21 = 495115109 is a prime.

Together with 495115109, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 495115111.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (495115141) 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, 247557555 + 247557556.

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

Almost surely, 2495115111 is an apocalyptic number.

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

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

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

The product of its digits is 900, while the sum is 28.

The square root of 495115111 is about 22251.1822382542. The cubic root of 495115111 is about 791.1073031764.

The spelling of 495115111 in words is "four hundred ninety-five million, one hundred fifteen thousand, one hundred eleven".