Properties of the Number -11954

Eleven Thousand Nine Hundred Fifty-Four

Basics

Value: -11955 → -11954 → -11953

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 43 × 139

Divisors: 1, 2, 43, 86, 139, 278, 5977, 11954

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10111010110010

Octal: -27262

Duodecimal: -6B02

Hexadecimal: -2eb2

Square: 142898116

Square Root: 109.33434958877288

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

G.f. satisfies: A(x) = 1 + x*(A(x) + A(-x)) + x²*A(x)*A(-x). A208888

Positive numbers whose product of digits is 9 times their sum. A62041

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals, where A(n,k) is ∑_d∣n d^k·n/d. A308509

Triangle read by rows: T(n,k) = number of heapable permutations of length n with exactly k consecutive pairs. A389993

Numbers k such that 2^k, 3^k, 5^k, 7^k, 11^k, 13^k, 17^k and 19^k have even digit sum. A119897

a(n) = 9·n² - 10·n + 3. A154262

Number of (m1,m2,n1,n2) in {0,1,...,n}⁴ such that gcd(X^m1 + (1+X)ⁿ¹, X^m2 + (1+X)ⁿ²) = 1 over GF(2). A245488

Number of partitions p of n such that the m(M(p)) is a part, where m = multiplicity, M = the maximum multiplicity of the parts of p. A240538

Numbers n such that 1+16n², 1+16(n+1)² and 1+16(n+2)² are prime. A255635

a(n) = 2·F(n-1) + 9·F(n-4) + 9·F(n-7) where n >= 7 and F = A000045. A280931