316
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 560
- Proper Divisor Sum (Aliquot Sum)
- 244
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 156
- Möbius Function
- 0
- Radical
- 158
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- dreihundertsechzehn· ordinal: dreihundertsechzehnste
- English
- three hundred sixteen· ordinal: three hundred sixteenth
- Spanish
- trescientos dieciséis· ordinal: 316º
- French
- trois cent seize· ordinal: trois cent seizième
- Italian
- trecentosedici· ordinal: 316º
- Latin
- trecenti sedecim· ordinal: 316.
- Portuguese
- trezentos e dezesseis· ordinal: 316º
Appears in sequences
- Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed.at n=13A000013
- a(n) is the number of distinct (infinite) output sequences from binary n-stage shift register which feeds back the complement of the last stage.at n=13A000016
- Boustrophedon transform of 1, 1, 4, 9, 16, ...at n=5A000697
- Number of degree-n even permutations of order dividing 2.at n=8A000704
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4), with a(0)=a(1)=0, a(2)=1, a(3)=2.at n=11A001630
- Primes multiplied by 4.at n=21A001749
- Related to partitions.at n=7A002040
- Numbers k such that (k^2 + k + 1)/3 is prime.at n=42A002640
- Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = least number > a(n-1) which is a unique sum of two distinct earlier terms.at n=55A002858
- The minimal sequence from solving n^3 - m^2 = a(n).at n=49A002938
- Number of n-node labeled acyclic digraphs with 1 out-point.at n=3A003025
- Numbers that are the sum of 12 positive 5th powers.at n=12A003357
- a(n) is smallest number which is uniquely of the form a(j) + a(k) with 1 <= j < k < n and a(1) = 1, a(2) = 4.at n=56A003666
- Sums of distinct positive cubes.at n=42A003997
- Numbers that are the sum of 4 but no fewer nonzero squares.at n=50A004215
- a(n) = floor(100*log_2(n)).at n=8A004262
- Divisible only by primes congruent to 2 mod 7.at n=26A004620
- Numbers k such that 2*(2k-3)!/(k!*(k-1)!) is an integer.at n=34A004782
- Numbers k such that 3!*(2k-4)!/(k!*(k-1)!) is an integer.at n=43A004783
- Centered triangular numbers: a(n) = 3*n*(n-1)/2 + 1.at n=14A005448