Properties of the Number -16793

Sixteen Thousand Seven Hundred Ninety-Three

Basics

Value: -16794 → -16793 → -16792

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 7 × 2399

Divisors: 1, 7, 2399, 16793

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100000110011001

Octal: -40631

Duodecimal: -9875

Hexadecimal: -4199

Square: 282004849

Square Root: 129.5878080685062

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

a(n) = T(n, n-4), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 4. A26524

a(n) = (4·n³ - 9·n² + 11·n + 3)/3. A161707

Irregular array read by rows. a(n) is the largest element in the primitive Collatz-like 3x-k cycle associated with A226623(n). A226624

n for which A079277(n) + φ(n) < n. A208815

a(n) = a(n-1)+a(n-2)+3a(n-3), with a(0)=a(1)=a(2)=1. A99213

Number of rooted twice-partitions of n where the composite rooted partition is strict. A301750

a(n) = T(n,n-4), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 4. A26541

a(n) = n⁵ - 2n. A242436

Numbers k such that (prime(j)-1)² + 1 is prime for k <= j <= k + 2. A376522

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 774", based on the 5-celled von Neumann neighborhood. A273504