Properties of the Number 38560

Thirty-Eight Thousand Five Hundred Sixty

Basics

Value: 38559 → 38560 → 38561

Parity: even

Prime: No

Previous Prime: 38557

Next Prime: 38561

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 5 × 241

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011010100000

Octal: 113240

Duodecimal: 1A394

Hexadecimal: 96a0

Square: 1486873600

Square Root: 196.36700333813724

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

E.g.f. A(x) satisfies: A(x)^A(x) = 1/(1 - x·A(x)³). A216136

Greatest number m such that the fractional part of (10/9)^A153695(m) >= 1-(1/m). A153699

Number of arrays of 2n nondecreasing integers in -3..3 with sum zero and equal numbers greater than zero and less than zero. A203286

Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/2)). A114690

a(0)=a(1)=1, a(n) = a(n-1) + a(a(n-2) mod n). A215525

Maximum number of copies of a 1234 permutation pattern in an alternating (or zig-zag) permutation of length n + 5. A338429

Number of strings of numbers x(i=1..n) in 0..8 with sum i·x(i)² equal to n·64. A184440

Number of strings of numbers x(i=1..8) in 0..n with sum i·x(i)² equal to n·64. A184447

Number of strings of numbers x(i=1..n) in 0..n with sum i·x(i)² equal to n³. A184433

T(n,k)=Number of strings of numbers x(i=1..n) in 0..k with sum i·x(i)² equal to n·k². A184441