Properties of the Number 31542

Thirty-One Thousand Five Hundred Forty-Two

Basics

Value: 31541 → 31542 → 31543

Parity: even

Prime: No

Previous Prime: 31541

Next Prime: 31543

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 7 × 751

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 751, 1502

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101100110110

Octal: 75466

Duodecimal: 16306

Hexadecimal: 7b36

Square: 994897764

Square Root: 177.60067567439037

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

Coefficients of the generalized continued fraction expansion of the inverse of Euler constant, 1/γ = a(1) +a(1)/(a(2) +a(2)/(a(3) +a(3)/(a(4) +a(4)/....))). A233585

Numbers n such that A182134(n) = 3, i.e., there exist only three primes p with prime(n) < p < prime(n)^{1 + 1/n}. A246781

Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a0,a1,a1,a1,a2,a2,a2,a3,a3,a3,...). A51166

Decimal encoding T(n,k) of the k-th non-averaging permutation of [n]; triangle T(n,k), n >= 0, k = 1..A003407(n), read by rows. A292523

T(n, 2·n-5), T given by A027960. A27967

Number of nX4 0..1 arrays with every element unequal to 0, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero. A305043

Triangle read by rows, T(n,k) for 0<=k<=n, generalizing A098742. A216916

Number of (n+1) X (2+1) arrays of permutations of 0..n·3+2 with each element having directed index change 1,1 2,2 -1,0 or 0,-1. A264649

Number of permutations in S_n avoiding 31{bar 5}{bar 4}2 (i.e., every occurrence of 312 is contained in an occurrence of a 31542). A137550

a(n) is the number of ways to place non-attacking queens on an n X n board with no queens above the main diagonal. A359032