ℕ atory
Play Now

Properties of the Number 38934

Thirty-Eight Thousand Nine Hundred Thirty-Four

Basics

Value: 38933 → 38934 → 38935

Parity: even

Prime: No

Previous Prime: 38933

Next Prime: 38953

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 3 × 7 × 103

Divisors: 1, 2, 3, 6, 7, 9, 14, 18, 21, 27

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001100000010110

Octal: 114026

Duodecimal: 1A646

Hexadecimal: 9816

Square: 1515856356

Square Root: 197.3170038288642

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: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1). A10027
Triangle read by rows: T(n,k) is the number of permutations of [n] having k small descents (n >= 1; 0 <= k <= n-1). A small descent in a permutation (x1,x2,...,xn) is a position i such that xi - xi+1 = 1. A123513
T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero. A304551
Number of permutations of length n with 4 consecutive ascending pairs. A1260
a(n) = prime(n)*T(n), where T = A000217. A196421
T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero. A316376
Row sums in A083175. A83175
Number of Dyck paths of semilength n having no UDDU's starting at level 1. A135334
Triangle read by rows: T(n,k) is the number of k-matchings in the Cn X P3 graph (Cn is the cycle graph on n vertices and P3 is the path graph on 3 vertices). A102089
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UDDU's starting at level 1. A135328