Properties of the Number 42531

Forty-Two Thousand Five Hundred Thirty-One

Basics

Value: 42530 → 42531 → 42532

Parity: odd

Prime: No

Previous Prime: 42509

Next Prime: 42533

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 14177

Divisors: 1, 3, 14177, 42531

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011000100011

Octal: 123043

Duodecimal: 20743

Hexadecimal: a623

Square: 1808885961

Square Root: 206.23045361924605

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

Sum over all partitions of n of the number of distinct parts i of multiplicity i+1. A276434

a(n) = numerator of polynomial of genus 1 and level n for m = 6 = A[1,n](6). A145664

G.f.: ∏_k>=1 (1 + x^k*(k+1/2)) / (1 - x^k). A280421

Number of permutations avoiding the consecutive pattern 42531. A202230

a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1] as of [2, 2]. A211277

Number of permutations of 1..n containing the relative rank sequence { 42531 } at any spacing. A158429

Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions. A2464

a(n) = (n-1)*(n+1)!/6. A5990

Number of permutations containing 3241 patterns only as part of 35241 patterns. A110447

Number of permutations p of {1,...,n} such that exactly one element of {p(1),...,p(i-1)} is between p(i) and p(i+1) for all i from 2 to n-1. A185030