Properties of the Number -16712

Sixteen Thousand Seven Hundred Twelve

Basics

Value: -16713 → -16712 → -16711

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 2089

Divisors: 1, 2, 4, 8, 2089, 4178, 8356, 16712

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000101001000

Octal: -40510

Duodecimal: -9808

Hexadecimal: -4148

Square: 279290944

Square Root: 129.2749008895385

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) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 1,0 0,-1 1,2 or -1,1. A264583

First position of n in A354578, where A354578(k) is the number of integer compositions whose run-sums constitute the k-th composition in standard order (graded reverse-lexicographic, A066099). A354905

Number of ways to write n as the root-mean-square (RMS) of a set of distinct primes. A163974

Numbers k such that k and k+1 are both of the form p·q³ where p and q are distinct primes. A215173

a(n) is the smallest integer k such that the n-th (backward) difference of the partition sequence A000041 is positive from k onwards. A155861

Number of inequivalent (ordered) solutions to n² = sum of 8 squares of integers >= 0. A65462

Number of 6-element subsets of [n] having a prime element sum. A320681

Number of (3+1)X(n+1) arrays of permutations of 0..n·4+3 with each element having directed index change 1,0 0,-1 1,2 or -1,1. A264586