ℕ atory
Play Now

Properties of the Number 42513

Forty-Two Thousand Five Hundred Thirteen

Basics

Value: 42512 → 42513 → 42514

Parity: odd

Prime: No

Previous Prime: 42509

Next Prime: 42533

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 37 × 383

Divisors: 1, 3, 37, 111, 383, 1149, 14171, 42513

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011000010001

Octal: 123021

Duodecimal: 20729

Hexadecimal: a611

Square: 1807355169

Square Root: 206.18680850141698

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 permutations of [1..n] which avoid 4231 and 42513. A98746
Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UDUUDU (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor(n/2)-1), read by rows. A243366
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
Number of Dyck paths of semilength n avoiding the consecutive steps UDUUDU (with U=(1,1), D=(1,-1)). A243412
Number of permutations avoiding the patterns {2431, 3421, 4231, 4321, 24513, 42513, 34512, 43512}; number of strong sorting class based on 2431. A111285
Number of compositions of n such that two adjacent parts are not equal modulo 3. A62201
Expansion of (1-x)/(1+x-x2-2·x3). A78041
Number of permutations avoiding the patterns {4231, 4321, 35142, 45312, 42513, 45132, 35412, 45213, 43512, 456123, 351624, 451623, 356124}; number of strong sorting class based on 4231. A111280
Number of permutations of 1..n containing the relative rank sequence { 42513 } at any spacing. A158428
a(n) = binomial(3·n,n)/(2·n+1) (enumerates ternary trees and also noncrossing trees). A1764