Properties of the Number -14446

Fourteen Thousand Four Hundred Forty-Six

Basics

Value: -14447 → -14446 → -14445

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 31 × 233

Divisors: 1, 2, 31, 62, 233, 466, 7223, 14446

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11100001101110

Octal: -34156

Duodecimal: -843A

Hexadecimal: -386e

Square: 208686916

Square Root: 120.19151384353223

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

a(n) = (n+1)*(n²+n+2)/2; g.f.: (1 + 2·x²) / (1 - x)⁴. A6000

a(n) = ∑_k=1..n lcm(n,k). A51193

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically. A207305

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically. A208164

The fifth term of the greedy B_n set of natural numbers. A369817

Triangle read by rows: T(n,k) = number of heapable permutations of length n that contain the max element on position k (positions starting from 0). A390546

33-gonal numbers: n(31n-29)/2. A98923

Triangle read by rows: Coefficients of the Eulerian polynomials EC(n, x)*EZ(n, x), where EC denote the classical Eulerian and EZ the zig-zag Eulerian polynomials. A373434

Integers n such that 10ⁿ-57 is prime. A108493

Number of n X 7 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically. A207304