Properties of the Number -71793

Seventy-One Thousand Seven Hundred Ninety-Three

Basics

Value: -71794 → -71793 → -71792

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 2659

Divisors: 1, 3, 9, 27, 2659, 7977, 23931, 71793

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -10001100001110001

Octal: -214161

Duodecimal: -35669

Hexadecimal: -11871

Square: 5154234849

Square Root: 267.94215793711896

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) gives the number of permutations of the set [n] that contain k occurrences of the subword (132); irregular array read by rows (n >= 0 and 0 <= k <= max(0, floor((n-1)/2))). A197365

Number of permutations avoiding a consecutive 132 pattern. A111004

T(n,k)=Number of nXk 0..2 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..2 introduced in row major order. A241130

Number T(m,n) of permutations of [n] avoiding the consecutive pattern 12...(m+1)(m+3)(m+2), where m, n >= 0; array read by ascending antidiagonals. A327722

Indices of products of twin primes in the semiprimes. A131188

Numbers k such that k²+4, k²+8, and k²+10 are prime. A157929

Number of n X 1 (-1,0,1) arrays of determinants of 2 X 2 subblocks of some (n+1) X 2 binary array. A226710

Number of n X 2 0..2 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..2 introduced in row major order. A241125

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 1, 1), (1, -1, 1), (1, 0, 0)}. A148271

Triangle read by rows, T(n, k) = A000262(n) - A349776(n, n - k) for n > 0 and T(0, 0) = 1. A349780