Properties of the Number -16066

Sixteen Thousand Sixty-Six

Basics

Value: -16067 → -16066 → -16065

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 29 × 277

Divisors: 1, 2, 29, 58, 277, 554, 8033, 16066

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11111011000010

Octal: -37302

Duodecimal: -936A

Hexadecimal: -3ec2

Square: 258116356

Square Root: 126.75172582651489

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

Coefficient of q² in ν(n), where ν(0)=1, ν(1)=b and, for n>=2, ν(n)=b*ν(n-1)+λ*(1+q+q²+...+q^n-2)*ν(n-2) with (b,λ)=(1,1). A74082

Number T(n,k) of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A258829

Number of integer partitions of n whose LCM is less than n. A327781

a(n) is the number of partitions of n with Durfee square of size <= 3. A330641

Number of compositions (ordered partitions) of n into at most 6 nonprime parts. A347799

Least number k >= 0 such that (n!-k)/n is prime. A245696

a(n) = (1 + ∑_j=1..K-1 a(n-j) + a(n-1)*a(n-K+1))/a(n-K) with a(1),...,a(K)=1, where K=5. A283330

a(n) = Fibonacci(2n+1) + n·2^n-1. A81663

Number of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of five. A316392

Positive integers that have exactly nine representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes. A317399