Properties of the Number 38713

Thirty-Eight Thousand Seven Hundred Thirteen

Basics

Value: 38712 → 38713 → 38714

Parity: odd

Prime: Yes

Previous Prime: 38711

Next Prime: 38723

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 38713

Divisors: 1, 38713

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011100111001

Octal: 113471

Duodecimal: 1A4A1

Hexadecimal: 9739

Square: 1498696369

Square Root: 196.75619431164043

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(1) = 1 and a(n) = ceiling((∑_k=1..n-1 a(k))/3) for n >= 2. A72493

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..3 introduced in row major order. A231451

Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people. A5427

Number of ways writing n! as a sum of two primes. A62311

a(n) = ∑_{k=0..floor(n/4)} (-1)^k * binomial(n-3·k,k) * Catalan(k). A360026

Number of rooted trees with n nodes and 5 leaves. A55280

Primes of the form 5n² - 7. A201788

Number of (n+1)X(6+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..3 introduced in row major order. A231449

Number of (3+1)X(n+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..3 introduced in row major order. A231453

Primes p such that (p⁵¹² + 1)/2 is prime. A341264