Properties of the Number -4791

Seven Hundred Ninety-One

Basics

Value: -4792 → -4791 → -4790

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 1597

Divisors: 1, 3, 1597, 4791

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1001010110111

Octal: -11267

Duodecimal: -2933

Hexadecimal: -12b7

Square: 22953681

Square Root: 69.21704992268884

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

Values of n such that L(17) and N(17) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227520

Fibonacci sequence beginning 0, 3. A22086

a(n) = (1/n) * ∑_i=0..n-1 C(n,i)*C(n,i+1)*2ⁱ*3^n-i, a(0)=1. A103210

Square array T(n,d) read by antidiagonals: number of structurally-different guillotine partitions of a d-dimensional box in R^d by n hyperplanes. A103209

Number of connected components of n faces of the rhombicuboctahedron up to the 48 rotations and reflections of the rhombicuboctahedron. A384070

Wythoff difference array, D={d(i,j)}, by antidiagonals. A80164

Number of integer partitions of n having more than one permutation with all equal run-lengths. A383090

T(n,k) = 3·A046802(n,k) - 2·A007318(n,k), triangle read by rows (0 <= k <= n). A168288

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n 2^j * binomial(n,j) * binomial(k·n+j+1,n)/(k·n+j+1). A336574

a(0) = 1; for n>0, a(n) = 3·Fibonacci(n). A97135