Properties of the Number -33969

Thirty-Three Thousand Nine Hundred Sixty-Nine

Basics

Value: -33970 → -33969 → -33968

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 13 ² × 67

Divisors: 1, 3, 13, 39, 67, 169, 201, 507, 871, 2613

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000010010110001

Octal: -102261

Duodecimal: -177A9

Hexadecimal: -84b1

Square: 1153892961

Square Root: 184.30680942385172

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

Number of non-Fibonacci parts in all partitions of n. A144116

Number of partitions of n containing m(5) as a part, where m denotes multiplicity. A240490

a(n) = ∑_k=0..4 binomial(8,k)*binomial(n,k). A247609

Monotonic ordering of set S generated by these rules: if·and y are in S and x²-y²>0 then x²-y² is in S, and 2 and 3 are in S. A192648

Number of (w,x,y,z) with all terms in {1,...,n} and w+y=|x-y|+|y-z|. A212677

The eventual period of a sequence b(n, m) where b(n, 1) = 1 and the m-th term is the number of occurrences of b(n, m-1) in the list of integers from b(n, max(m-n, 1)) to b(n, m-1). A334539

G.f.: exp( Integral ∑_n>=1 n!*nⁿ*x^n-1 / ∏_k=1..n (1+k·n*x) dx ). A243809

Number of pairs in generation n of the tree T defined in Comments. A252864

Numbers n such that n | 9ⁿ + 8ⁿ + 7ⁿ + 6ⁿ + 5ⁿ + 4ⁿ. A57260

Expansion of ∑_k>0 (x / (1 - 2·x^k))^k. A360801