Properties of the Number -11624

Eleven Thousand Six Hundred Twenty-Four

Basics

Value: -11625 → -11624 → -11623

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 1453

Divisors: 1, 2, 4, 8, 1453, 2906, 5812, 11624

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10110101101000

Octal: -26550

Duodecimal: -6888

Hexadecimal: -2d68

Square: 135117376

Square Root: 107.81465577554843

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

Number of algebraically independent elements of degree n in the algebra of symmetric polynomials in noncommuting variables. A74664

Maximal coefficient of the polynomial (1-x)*(1-x²)*...*(1-xⁿ). A86376

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (0,-1) (-1,-2) or (-2,0) and new values introduced in order 0..2. A275037

The maximum of the absolute value of the coefficients of Pn = (1-x)(1-x²)(1-x³)...(1-xⁿ). A160089

Number of linear arrangements of n blue, n red and n green items such that the first item is blue and there are no adjacent items of the same color (first and last elements considered as adjacent). A141147

First of two consecutive numbers with at least one 3 in their prime signature. A176313

(-1) times minimal coefficient of the polynomial (1-x)*(1-x²)*...*(1-xⁿ). A86394

Numbers which need ten 'Reverse and Add' steps to reach a palindrome. A65215

Triangular array where T(n,k) is the number of set partitions of n with k atomic parts. A127743

Triangle related to Bell numbers; T(n,k) read by rows, n>=0, 0<=k<=n: T(n,k) = k·T(n-1,k) + Sum(0<=j, T(n-1,k-1+j)); T(0,0)=1, T(0,k)=0 if k>0. A86211