Search a number
-
+
315052131 = 3105017377
BaseRepresentation
bin10010110001110…
…101000001100011
3210221211022021110
4102301311001203
51121123132011
651132354403
710543620222
oct2261650143
9727738243
10315052131
11151925369
1289615a03
135036b0a4
142dbb0cb9
151c9d3ba6
hex12c75063

315052131 has 4 divisors (see below), whose sum is σ = 420069512. Its totient is φ = 210034752.

The previous prime is 315052097. The next prime is 315052189. The reversal of 315052131 is 131250513.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131250513 = 343750171.

It is not a de Polignac number, because 315052131 - 29 = 315051619 is a prime.

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

It is a Duffinian number.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52508686 + ... + 52508691.

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

Almost surely, 2315052131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 105017380.

The product of its (nonzero) digits is 450, while the sum is 21.

The square root of 315052131 is about 17749.7079130897. The cubic root of 315052131 is about 680.4467443531.

The spelling of 315052131 in words is "three hundred fifteen million, fifty-two thousand, one hundred thirty-one".

Divisors: 1 3 105017377 315052131