Properties of the Number 31376

Thirty-One Thousand Three Hundred Seventy-Six

Basics

Value: 31375 → 31376 → 31377

Parity: even

Prime: No

Previous Prime: 31357

Next Prime: 31379

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 37 × 53

Divisors: 1, 2, 4, 8, 16, 37, 53, 74, 106, 148

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 111101010010000

Octal: 75220

Duodecimal: 161A8

Hexadecimal: 7a90

Square: 984453376

Square Root: 177.13271860387624

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

A Chebyshev transform of the Pell numbers. A100048

Number of partitions of n such that (greatest part) - (least part) <= number of parts. A237831

Number of partitions of n such that the number of parts having multiplicity >1 is a part and the number of distinct parts is a part. A241409

Number of subwords of the form DDD in nondecreasing Dyck paths of length 2n. A377679

Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k LL's (n >= 0; 0 <= k <= n-2 for n >= 2). A128724

a(n) = Fibonacci(p) mod p², where p = prime(n). A236395

Number of (w,x,y,z) with all terms in {1,...,n} and w·x+y·z>n². A212136

Half the number of 8 X n binary arrays with no path of adjacent 1's or adjacent 0's from top row to bottom row. A69434

Half the number of n X 2 binary arrays with no path of adjacent 1's or adjacent 0's from top row to bottom row. A69440

a(n) is the index of the permutation of order n having the least sum of pairwise products as given by A026035. A102401