ℕ atory
Play Now

Properties of the Number 3147

Three Thousand One Hundred Forty-Seven

Basics

Value: 3146 → 3147 → 3148

Parity: odd

Prime: No

Previous Prime: 3137

Next Prime: 3163

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 1049

Divisors: 1, 3, 1049, 3147

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110001001011

Octal: 6113

Duodecimal: 19A3

Hexadecimal: c4b

Square: 9903609

Square Root: 56.098128311023

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 strict partitions of 2n that include a partition of n. A237258
Number of compositions of n into positive triangular numbers. A23361
Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 6 multiples of n-1, n-2, ..., 1. A113743
Number of unlabeled loop-graphs with up to n vertices such that it is possible to choose a different vertex from each edge (choosable). A369145
Numbers n such that n, n+2, n+4, n+6 are semiprimes. A92126
Numbers k such that k, k+2, k+4, k+6, k+8 are semiprimes. A92127
T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..3 introduced in row major order. A204483
T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i4*x(i,j), i=1..n+1} nondecreasing. A232797
T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 5 6 or 7. A252219
Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies bp-1 == 1 (mod p2) and q = prime(n+1) satisfies bq-1 == 1 (mod q2). A259075