Properties of the Number 31472

Thirty-One Thousand Four Hundred Seventy-Two

Basics

Value: 31471 → 31472 → 31473

Parity: even

Prime: No

Previous Prime: 31469

Next Prime: 31477

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 7 × 281

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 56, 112

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101011110000

Octal: 75360

Duodecimal: 16268

Hexadecimal: 7af0

Square: 990486784

Square Root: 177.40349489229348

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(n+1) = ∑_{k=0..floor(n/5)} a(k) * a(n-k). A30036

G.f.: ∏_n=-oo..+oo (1 + xⁿ*(1 + xⁿ)ⁿ). A293603

Number of basis partitions of n+100 with Durfee square size 10. A69253

Expansion of e.g.f.: sech(cosh(x)*log(x+1))=1-1/2!*x²+3/3!*x³-18/4!*x⁴+60/5!*x⁵... A12763

a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026769. A26891

G.f.: square root of weight enumerator of [16,5,8] Reed-Muller code RM(1,4). A110822

Number of unordered pairs of self-avoiding paths whose sets of nodes are disjoint subsets of a set of n points on a circle; one-node paths are not allowed. A360716

Number of unordered pairs of self-avoiding paths whose sets of nodes are disjoint subsets of a set of n points on a circle; one-node paths are allowed. A360717

Numbers whose base-5 representation has 2 more 0's than 4's. A31472