Properties of the Number 31947

Thirty-One Thousand Nine Hundred Forty-Seven

Basics

Value: 31946 → 31947 → 31948

Parity: odd

Prime: No

Previous Prime: 31907

Next Prime: 31957

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 23 × 463

Divisors: 1, 3, 23, 69, 463, 1389, 10649, 31947

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110011001011

Octal: 76313

Duodecimal: 165A3

Hexadecimal: 7ccb

Square: 1020610809

Square Root: 178.73723730661163

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

Triangle read by rows of numbers b_n,k, n>=1, 1<=k<=n such that ∏_n,k 1/(1-qⁿ t^k)^b_n,k = 1 + ∑_i,j>=1 S_i,j qⁱ t^j where S_i,j are entries in the table A008277 (the inverse Euler transformation of the table of Stirling numbers of the second kind). A112340

Triangle read by rows: T(n,k) is the number of permutations of n elements with k the (smallest) header (first element) of the longest descending subsequence. A224652

Triangle read by rows of numbers b_n,k, n >= 2, 1 <= k < n such that (1/(1-q·t))*∏_n,k 1/(1 - qⁿ*t^k)^b_{n,k} = ∑_i,j>=1 S_i,j qⁱ*t^j where S_i,j are entries in the table A008277 (the inverse Euler transformation of the table of Stirling numbers of the second kind). A112339

Numbers in which 0,1,2,3,4,5 all occur in base 6. A31947

Let d(n,i), i = 1..k be the k divisors of n² + 1 (the number 1 is not counted). a(n) is the number of ordered pairs d(n,i) < d(n,j) such that gcd(d(n,i), d(n,j)) = 1. A321519