Properties of the Number -19196

Nineteen Thousand One Hundred Ninety-Six

Basics

Value: -19197 → -19196 → -19195

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 4799

Divisors: 1, 2, 4, 4799, 9598, 19196

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100101011111100

Octal: -45374

Duodecimal: -B138

Hexadecimal: -4afc

Square: 368486416

Square Root: 138.54963009694396

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 that do not contain 1 as a part. A2865

Number of partitions of n that do not contain parts less than the smallest part of the partitions of n-1. A187219

Numbers k such that k and k+1 have the same sum of non-unitary divisors (A048146), for A048146(k) > 0. A64115

Bisection (odd part) of number of partitions that do not contain 1 as a part A002865. A182747

Riordan array (1/(1-x·C(x)³), x·C(x)), C(x) the g.f. of A000108. A236830

a(n) = T(2n-1,n-1) = T(2n,n+1), T given by A026725. A26674

Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n. A77405

Number of partitions of n in which both smallest and largest part occur only once. A117995

Expansion of g²/(1 - x²*g³), where g = 1+x·g⁴ is the g.f. of A002293. A391080

Expansion of 1/(1-x·c(x)³), c(x) the g.f. of A000108. A165201