Search a number
-
+
316913 = 3110223
BaseRepresentation
bin1001101010111110001
3121002201112
41031113301
540120123
610443105
72456642
oct1152761
9532645
10316913
111a7113
12133495
13b132c
14836c9
1563d78
hex4d5f1

316913 has 4 divisors (see below), whose sum is σ = 327168. Its totient is φ = 306660.

The previous prime is 316907. The next prime is 316919. The reversal of 316913 is 319613.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 319613 = 745659.

It is an interprime number because it is at equal distance from previous prime (316907) and next prime (316919).

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-316913 is a prime.

It is a Duffinian number.

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

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

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

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

2316913 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10254.

The product of its digits is 486, while the sum is 23.

The square root of 316913 is about 562.9502642330. The cubic root of 316913 is about 68.1783811331.

The spelling of 316913 in words is "three hundred sixteen thousand, nine hundred thirteen".

Divisors: 1 31 10223 316913