Search a number
-
+
510131961 = 3256681329
BaseRepresentation
bin11110011001111…
…111111011111001
31022112220101111100
4132121333323321
52021043210321
6122341522013
715433023123
oct3631777371
91275811440
10510131961
11241a57769
12122a13309
13818c1a41
144ba72213
152ebba326
hex1e67fef9

510131961 has 6 divisors (see below), whose sum is σ = 736857290. Its totient is φ = 340087968.

The previous prime is 510131929. The next prime is 510131989. The reversal of 510131961 is 169131015.

It can be written as a sum of positive squares in only one way, i.e., 509901561 + 230400 = 22581^2 + 480^2 .

It is not a de Polignac number, because 510131961 - 25 = 510131929 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (510131261) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 28340656 + ... + 28340673.

Almost surely, 2510131961 is an apocalyptic number.

It is an amenable number.

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

510131961 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 56681335 (or 56681332 counting only the distinct ones).

The product of its (nonzero) digits is 810, while the sum is 27.

The square root of 510131961 is about 22586.1010579515. The cubic root of 510131961 is about 799.0258773586.

Adding to 510131961 its reverse (169131015), we get a palindrome (679262976).

The spelling of 510131961 in words is "five hundred ten million, one hundred thirty-one thousand, nine hundred sixty-one".

Divisors: 1 3 9 56681329 170043987 510131961