Search a number
-
+
503661331 is a prime number
BaseRepresentation
bin11110000001010…
…100001100010011
31022002201122110101
4132001110030103
52012414130311
6121551113231
715324023245
oct3601241423
91262648411
10503661331
11239338238
12120812817
1380467774
144ac6a095
152e33cec1
hex1e054313

503661331 has 2 divisors, whose sum is σ = 503661332. Its totient is φ = 503661330.

The previous prime is 503661317. The next prime is 503661349. The reversal of 503661331 is 133166305.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 503661331 - 27 = 503661203 is a prime.

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

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

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

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

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

Almost surely, 2503661331 is an apocalyptic number.

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

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

503661331 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 4860, while the sum is 28.

The square root of 503661331 is about 22442.4002949774. The cubic root of 503661331 is about 795.6331498756.

Adding to 503661331 its product of nonzero digits (4860), we get a triangular number (503666191 = T31738).

The spelling of 503661331 in words is "five hundred three million, six hundred sixty-one thousand, three hundred thirty-one".