Properties of the Number -14994

Fourteen Thousand Nine Hundred Ninety-Four

Basics

Value: -14995 → -14994 → -14993

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 7 ² × 17

Divisors: 1, 2, 3, 6, 7, 9, 14, 17, 18, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11101010010010

Octal: -35222

Duodecimal: -8816

Hexadecimal: -3a92

Square: 224820036

Square Root: 122.4499897917513

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 (ψ(-x³) / f(x))² in powers of·where ψ(), f() are Ramanujan θ functions. A261369

a(n) = σ(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341529

Starts of runs of 3 consecutive positive negaFibonacci-Niven numbers (A331085). A331087

a(n) = Fibonacci(n)² * Fibonacci(n+1). A66258

Restricted combinations. A6500

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1. A264128

Triangle T(n,k) (n >= 2, 2 <= k <= n-1 if n > 2) giving number of non-crossing trees with n nodes and k endpoints. A72247

Coefficients of the sixth-order mock θ function phi_-(q). A153251

a(n) = 100·n² - 151·n + 57. A157626

[s(k)-s(j)]/5, where the pairs (k,j) are given by A205852 and A205853, and s(k) denotes the (k+1)-st Fibonacci number. A205855