Properties of the Number -38165

Thirty-Eight Thousand One Hundred Sixty-Five

Basics

Value: -38166 → -38165 → -38164

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 17 × 449

Divisors: 1, 5, 17, 85, 449, 2245, 7633, 38165

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001010100010101

Octal: -112425

Duodecimal: -1A105

Hexadecimal: -9515

Square: 1456567225

Square Root: 195.35864454894235

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

Central pentanomial coefficients: largest coefficient of (1 + x + ... + x⁴)ⁿ. A5191

Square array read by diagonals: T(n,k) = number of arrays of n integers in -k..k with sum equal to 0. A201552

Composite numbers k of the form 4u+1 for which the odd part of φ(k) divides k-1. A339870

T(n,k)=Number of zero-sum nXk -2..2 arrays with every element unequal to at most two horizontal and vertical neighbors. A201803

a(n)*a(n-11) = a(n-1)*a(n-10)+a(n-5)+a(n-6) with initial terms a(1)=...=a(11)=1. A133848

Concatenation chain arising in A156069. A156071

a(n) is the number of Fibonacci meanders of length m·n and central angle 360/m degrees where m = 2. A201631

Largest coefficient of (1+x+...+xⁿ)^2·n. A270918

Number of partitions of n into at most 2 copies of 1, 3 copies of 2, 4 copies of 3, ... . A303939

Array read by ascending antidiagonals: the s-th column gives the central s-binomial coefficients. A349933