Properties of the Number -10192

Ten Thousand One Hundred Ninety-Two

Basics

Value: -10193 → -10192 → -10191

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 7 ² × 13

Divisors: 1, 2, 4, 7, 8, 13, 14, 16, 26, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10011111010000

Octal: -23720

Duodecimal: -5A94

Hexadecimal: -27d0

Square: 103876864

Square Root: 100.9554357129917

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

Square table, read by antidiagonals, where the g.f. for row n+1 is generated by: x·R_n+1(x) = (1+n·x - 1/R_n(x))/(n+1) with R₀(x) = ∑_n>=0 n!*xⁿ. A111528

Row 2 of table A111528. A111529

Number of reversible strings with n-1 beads of 2 colors. 4 beads are black. String is not palindromic. A32091

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than one. A269537

Composites whose prime factorization in base 3 is an anagram of the number in base 3. A260047

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by one or less. A269606

a(1) = 7; for n > 0, a(n+1) = a(n) * sum of digits of a(n). A47899

13 times the squares: a(n) = 13·n². A152742

Number of times the digit 8 appears in the first 10ⁿ digits of Catalan's constant. A224817

Product J₃(i), i=1..n. A59382