Properties of the Number -11079

Eleven Thousand Seventy-Nine

Basics

Value: -11080 → -11079 → -11078

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 1231

Divisors: 1, 3, 9, 1231, 3693, 11079

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10101101000111

Octal: -25507

Duodecimal: -64B3

Hexadecimal: -2b47

Square: 122744241

Square Root: 105.256828757093

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) = ∑_{k=0..floor(n/4)} (-1)^k * (n-3·k)!/(n-4·k)!. A358605

Number of isomorphism classes of quandles of order n. A181769

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303040

Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with prime side lengths. A70123

T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor, without move-in move-out straight through or left turns. A221817

Number of partitions p of n such that mean(p) >= multiplicity(min(p)). A240079

Sum of the smallest parts in the partitions of n into 6 parts. A308868

Number of integer compositions of n that are the 0-prepended first sums of some finite sequence of distinct integers. A392702

Number of partitions p of n such that mean(p) > multiplicity(min(p)). A240206

Numbers m such that m! + p is a prime, where p is the smallest prime > m. A84749