Properties of the Number -11472

Eleven Thousand Four Hundred Seventy-Two

Basics

Value: -11473 → -11472 → -11471

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 239

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110011010000

Octal: -26320

Duodecimal: -6780

Hexadecimal: -2cd0

Square: 131606784

Square Root: 107.10742271196708

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

McKay-Thompson series of class 14a for Monster. A58505

Number of partitions of n having depth 1; see Comments. A237685

T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors. A231839

The number of permutations p of {1,...,n} such that |p(i)-p(i+1)| is in {3,4} for all i from 1 to n-1. A174706

T(n,k) is the number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors. A200886

T(n,k) = number of n-element 0..3 arrays with each element the minimum of k adjacent elements of a random 0..3 array of n+k-1 elements. A217954

T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors. A231940

Number of nX1 0..3 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor. A203094

Partial sums of A002522, starting at n=1. A145066

T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors. A231700