Properties of the Number -11067

Eleven Thousand Sixty-Seven

Basics

Value: -11068 → -11067 → -11066

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 17 × 31

Divisors: 1, 3, 7, 17, 21, 31, 51, 93, 119, 217

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10101100111011

Octal: -25473

Duodecimal: -64A3

Hexadecimal: -2b3b

Square: 122478489

Square Root: 105.19980988575978

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 ∏_k>=1 1/(1+x^k)^(-1^k*k²). A307484

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

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

Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i·j*k| <= n and gcd(i,j,k) <= 1. A226357

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

Sum of the partition parts of 3n into 3 parts. A235988

Sum of median parts of all partitions of n into an odd number of parts. A211373

Sum of the parts in the partitions of 4n into 4 parts with smallest part equal to 1 minus the number of these partitions. A239057

Number of integer partitions of n for which the distinct parts have the same median as the multiplicities. A360455

Largest number not the sum of distinct n-th-order polygonal numbers. A7419