Properties of the Number 3138

Three Thousand One Hundred Thirty-Eight

Basics

Value: 3137 → 3138 → 3139

Parity: even

Prime: No

Previous Prime: 3137

Next Prime: 3163

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 523

Divisors: 1, 2, 3, 6, 523, 1046, 1569, 3138

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110001000010

Octal: 6102

Duodecimal: 1996

Hexadecimal: c42

Square: 9847044

Square Root: 56.01785429664367

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 points on surface of octahedron; also coordination sequence for cubic lattice: a(0) = 1; for n > 0, a(n) = 4n² + 2. A5899

Number of partitions with no even part repeated; partitions of n in which no parts are multiples of 4. A1935

Number of strict integer partitions of n such that some part can be written as a nonnegative linear combination of the others. A364839

Triangle read by rows: T(n,k) = number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to k. A180281

Expansion of ψ(x) / φ(x) in powers of·where φ(), ψ() are Ramanujan θ functions. A83365

Number of subsets of {1..n} whose greatest element can be written as a (strictly) positive linear combination of the others. A365043

Coordination sequence for C₃ lattice: a(n) = 16·n² + 2 (n>0), a(0)=1. A10006

a(n) = 3·a(n-1)-4·a(n-3)+a(n-4)+a(n-5)+3·a(n-6)-a(n-7) for n >= 8, with initial values as shown. A238823

Numbers k such that A380845(k) = 2·k. A380846

a(1)=0; thereafter, a(n) is the smallest number such that the addition table for (a(1),...,a(n)) contains n*(n+1)/2 different entries, and the multiplication table for (a(2),...,a(n)) contains n*(n-1)/2 different nonzero entries (the maximum possible in both cases). A337656