Properties of the Number 31368

Thirty-One Thousand Three Hundred Sixty-Eight

Basics

Value: 31367 → 31368 → 31369

Parity: even

Prime: No

Previous Prime: 31357

Next Prime: 31379

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 1307

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 1307, 2614

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101010001000

Octal: 75210

Duodecimal: 161A0

Hexadecimal: 7a88

Square: 983951424

Square Root: 177.11013522664365

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 sum-full subsets of {1,...,n}; subsets A such that there is a solution to x+y=z for x,y,z in A. A93971

(1/8) * number of ways to select 3 distinct points forming a triangle of unsigned area = 1 from a square of grid points with side length n. A320544

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns ending at an odd level (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121697

Positive integers m with binary expansion (b₁, ..., b_k) (where k = A070939(m)) such that b_i = [m == 0 (mod i)] for i = 1..k (where [] is an Iverson bracket). A320673

Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 3 X n array. A219520

Odd-indexed primes: a(n) = prime(2n-1). A31368