Properties of the Number -19892

Nineteen Thousand Eight Hundred Ninety-Two

Basics

Value: -19893 → -19892 → -19891

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 4973

Divisors: 1, 2, 4, 4973, 9946, 19892

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100110110110100

Octal: -46664

Duodecimal: -B618

Hexadecimal: -4db4

Square: 395691664

Square Root: 141.03900169811186

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 n such that there are precisely 5 groups of orders n and n + 1. A295991

Sum of prime factors of Fibonacci(n). A80648

Sum of primes dividing Fibonacci(n) (with repetition). A64725

Expansion of ∏_k>=1 1/(1 - x^k)^k*(5·k-3/2). A278769

Demi-tribonacci numbers (rounding up): a(0)=a(1)=0, a(2)=2; a(n) = ceiling( (a(n-1)+a(n-2)+a(n-3))/2 ). A180235

a(1) = a(2) = a(3) = 1; for n > 3, a(n) = ceiling((a(n-1) + a(n-2) + a(n-3))/2). A258875

Fifth Lie-Betti number of a path graph on n vertices. A364579

Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs of consecutive 0's (0<=k<=ceiling(n/2)). A119808

Number of 4Xn 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. A281059