Properties of the Number -19918

Nineteen Thousand Nine Hundred Eighteen

Basics

Value: -19919 → -19918 → -19917

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 23 × 433

Divisors: 1, 2, 23, 46, 433, 866, 9959, 19918

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100110111001110

Octal: -46716

Duodecimal: -B63A

Hexadecimal: -4dce

Square: 396726724

Square Root: 141.1311446846514

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

Numbers k such that there is more than one possible solution for A367338(k). A367346

Fibonacci sequence beginning 4, 10. A22382

3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10·last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]). A166513

Numbers k such that σ(k+2) = 2*σ(k). A175876

a(n) is the number of balanced-non-self-conjugate partitions of n. A331262

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (Fibonacci numbers). A24367

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 1), (1, -1, 1), (1, 0, 0)}. A150024