Properties of the Number 3316

Three Thousand Three Hundred Sixteen

Basics

Value: 3315 → 3316 → 3317

Parity: even

Prime: No

Previous Prime: 3313

Next Prime: 3319

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 829

Divisors: 1, 2, 4, 829, 1658, 3316

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011110100

Octal: 6364

Duodecimal: 1B04

Hexadecimal: cf4

Square: 10995856

Square Root: 57.584720195551874

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Number of subsets of {1..n} whose cardinality cannot be written as a nonnegative linear combination of the elements. A367223

T(n,k) = number of n X k 0..1 arrays with every element equal to 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302278

Irregular triangular array read by rows. T(n,k) is the number of ordered set partitions of [n] with exactly k descents, n>=0, 0<=k<=binomial(n,2). A381299

a(n) = n*(7·n + 11)/2 + 1. A198017

Numbers k such that Fibonacci(prime(k)) is prime. A119984

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302728

The records for distance squared for step lengths between adjacent primes in A330979, the visited primes for a walk stepping to the closest unvisited prime on the Ulam Spiral. A331027

Positive discriminants of orders of quadratic fields with form class number 3. A391425

Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from an n·n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle. A360354

T(n,k)=Number of nXk 0..2 arrays with no element unequal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279902