Properties of the Number -5492

Four Hundred Ninety-Two

Basics

Value: -5493 → -5492 → -5491

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 1373

Divisors: 1, 2, 4, 1373, 2746, 5492

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010101110100

Octal: -12564

Duodecimal: -3218

Hexadecimal: -1574

Square: 30162064

Square Root: 74.10802925459562

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

Expansion of ∏_k>=1 (1 - x^k)^k-1. A319108

Expansion of 1/(1 - x⁵ - x⁶ - x⁷ - x⁸ + x¹³). A173924

T(n,k)=Number of length-(n+1) 0..k arrays with new repeated values introduced in sequential order starting with zero. A268261

G.f. satisfies: A(x - 3·A(x)²) = x - A(x)². A277308

Expansion of 2·x²/(1 - 2·x - 2·x² + sqrt(1 - 4·x - 4·x²)). A52705

Least k such that there are exactly A003586(n) ways to choose a binary index of each binary index of k. A368111

Sorted positions of first appearances in A368109 (number of ways to choose a binary index of each binary index). A368112

Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2). A71943

Sum of the first n primes whose indices are primes. A83186

a(n) = S1(n,4), where S1(n,t) = ∑_k=0..n k^t * ∑_j=0..k binomial(n,j). A89661