Properties of the Number 38507

Thirty-Eight Thousand Five Hundred Seven

Basics

Value: 38506 → 38507 → 38508

Parity: odd

Prime: No

Previous Prime: 38501

Next Prime: 38543

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 × 5501

Divisors: 1, 7, 5501, 38507

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011001101011

Octal: 113153

Duodecimal: 1A34B

Hexadecimal: 966b

Square: 1482789049

Square Root: 196.2320055444575

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 non-equivalent binary n X n matrices with two nonadjacent 1's. A232567

n+φ(n)+φ(φ(n)) is a cube. A116042

Indices of primes in sequence defined by A(0) = 19, A(n) = 10·A(n-1) - 21 for n > 0. A102025

a(n) = n! + 1. A38507

T(n,k) = number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,1 or 1,2. A264071

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 0,1 or 1,2. A264341

Square table T, read by antidiagonals, where T(n,k) gives the number of n-th generation descendents of a node labeled (k) in the tree of tournament sequences. A93729

Number of ways to place 5 nonattacking kings on an n X n toroidal board. A179425

Number of (n+1) X (7+1) arrays of permutations of 0..n·8+7 with each element having index change +-(.,.) 0,0 1,1 or 1,2. A264070

Number of (n+1)X(7+1) arrays of permutations of 0..n·8+7 with each element having index change +-(.,.) 0,0 0,1 or 1,2. A264340