Properties of the Number -17941

Seventeen Thousand Nine Hundred Forty-One

Basics

Value: -17942 → -17941 → -17940

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 7 × 11 × 233

Divisors: 1, 7, 11, 77, 233, 1631, 2563, 17941

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100011000010101

Octal: -43025

Duodecimal: -A471

Hexadecimal: -4615

Square: 321879481

Square Root: 133.94401815684043

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

Expansion of 1/(1 + x/(1 + x³/(1 + x⁴/(1 + x⁷/(1 + x¹¹/(1 + ... + x^Lucas(k)/(1 + ...))))))), a continued fraction. A294922

4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n²+n+4)/12. A6007

Number of trees of diameter 4. A94

a(n) = ∑_k=1..n k*φ(k). A11755

Number of forests of rooted trees with total weight n, where a node at height k has weight 2^k (with root considered to be at height 0). A115593

T(n,k)=Number of 2nX2k 0..2 arrays with values 0..2 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors. A198452

Centered 23-gonal numbers. A69174

Odd composite integers m such that A001906(m-J(m,5)) == 0 (mod m) and gcd(m,5)=1, where J(m,5) is the Jacobi symbol. A340097

Odd composite integers m such that A004187(m-J(m,45)) == 0 (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol. A340099

a(n) = 12·n² - 8·n + 1. A185212