Search a number
-
+
494270141 is a prime number
BaseRepresentation
bin11101011101011…
…111011010111101
31021110001112011112
4131131133122331
52003013121031
6121013531405
715151140551
oct3535373275
91243045145
10494270141
11234003522
12119643b65
137b52a051
1449903861
152d5d562b
hex1d75f6bd

494270141 has 2 divisors, whose sum is σ = 494270142. Its totient is φ = 494270140.

The previous prime is 494270111. The next prime is 494270143. The reversal of 494270141 is 141072494.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 487747225 + 6522916 = 22085^2 + 2554^2 .

It is a cyclic number.

It is not a de Polignac number, because 494270141 - 222 = 490075837 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 2494270141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8064, while the sum is 32.

The square root of 494270141 is about 22232.1870494110. The cubic root of 494270141 is about 790.6570088558.

The spelling of 494270141 in words is "four hundred ninety-four million, two hundred seventy thousand, one hundred forty-one".