Search a number
-
+
495679152061 is a prime number
BaseRepresentation
bin1110011011010001100…
…01111001111110111101
31202101102201202220011101
413031220301321332331
531110122330331221
61015413432253101
750545251163132
oct7155061717675
91671381686141
10495679152061
11181241a60495
1280095b41191
1337985c0c212
1419dc3430589
15cd61631d91
hex7368c79fbd

495679152061 has 2 divisors, whose sum is σ = 495679152062. Its totient is φ = 495679152060.

The previous prime is 495679152013. The next prime is 495679152071. The reversal of 495679152061 is 160251976594.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 494903808036 + 775344025 = 703494^2 + 27845^2 .

It is a cyclic number.

It is not a de Polignac number, because 495679152061 - 29 = 495679151549 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2495679152061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4082400, while the sum is 55.

The spelling of 495679152061 in words is "four hundred ninety-five billion, six hundred seventy-nine million, one hundred fifty-two thousand, sixty-one".