Properties of the Number -18319

Eighteen Thousand Three Hundred Nineteen

Basics

Value: -18320 → -18319 → -18318

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 7 × 2617

Divisors: 1, 7, 2617, 18319

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100011110001111

Octal: -43617

Duodecimal: -A727

Hexadecimal: -478f

Square: 335585761

Square Root: 135.34770038681853

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 partitions of n such that 2*(greatest part) < (number of parts). A237751

G.f. satisfies A(x) = 1 + x·A(x)⁴*(1 + x·A(x)³). A365182

Triangle defined by T(n,k) = T(n-1,k-1) + ∑_j=k..n-2 T(n-1,j)*2^j*T(j,k-1) for n>k>0 with T(n,n)=T(n,0)=1, read by rows. A152795

Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1). A357694

Column 2 of triangle A152795. A152797

Integers of the form 4n+3 for which ∑_i=1..u J(i,4n+3) obtains value zero exactly 7 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol. A166057

a(n) = (n⁴ + 16·n³ + 65·n² + 26·n + 12)/12. A188480

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 363", based on the 5-celled von Neumann neighborhood. A268154

Numbers k such that both ∑_i=1..k i·prime(i) and ∑_i=1..k (k+1-i)*prime(i) are prime. A356178

Convoluted convolved Fibonacci numbers G₇^r. A89113