Properties of the Number -196448

One Hundred Ninety-Six Thousand Four Hundred Forty-Eight

Basics

Value: -196449 → -196448 → -196447

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ⁵ × 7 × 877

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -101111111101100000

Octal: -577540

Duodecimal: -95828

Hexadecimal: -2ff60

Square: 38591816704

Square Root: 443.22454805662557

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero. A205998

a(n) is the determinant of the 2 X 2 matrix whose entries (when read by rows) are the n-th primes ending in 1, 3, 7, 9 respectively. A335592

a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number). A23488

Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to two, and every 2 X 2 determinant nonzero. A205991

Number of length-n binary strings that are the concatenation of two nonempty palindromes. A370410

a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Lucas number). A23496

a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number). A23500