Properties of the Number -7348

Three Hundred Forty-Eight

Basics

Value: -7349 → -7348 → -7347

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 11 × 167

Divisors: 1, 2, 4, 11, 22, 44, 167, 334, 668, 1837

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1110010110100

Octal: -16264

Duodecimal: -4304

Hexadecimal: -1cb4

Square: 53993104

Square Root: 85.72047596694736

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

Fibonacci(p-J(p,5)) mod p², where p is the n-th prime and J is the Jacobi symbol. A113650

T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)). A234217

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime. A251950

Number of binary strict trees of weight n. A300442

a(n) = (15·n² + 9·n + 2)/2. A220083

Numbers that are the sum of nine fourth powers in six or more ways. A345590

Numbers that are the sum of nine fourth powers in exactly six ways. A345848

Number of different fixed (possibly) disconnected trominoes bounded tightly by an n X n square. A163433

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 5 or 7 king-move adjacent elements, with upper left element zero. A304926

G.f.: ∑_k>=1 x^k/(1-x^k) * ∏_k>=1 (1+x^k). A305082