Properties of the Number -33645

Thirty-Three Thousand Six Hundred Forty-Five

Basics

Value: -33646 → -33645 → -33644

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 2243

Divisors: 1, 3, 5, 15, 2243, 6729, 11215, 33645

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000001101101101

Octal: -101555

Duodecimal: -17579

Hexadecimal: -836d

Square: 1131986025

Square Root: 183.42573429047516

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 integer partitions of n with unimodal run-lengths. A332280

Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346426

53 'Reverse and Add' steps are needed to reach a palindrome. A65320

Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros. A126442

The total number of ways of partitioning the multiset {1,1,1,2,3,...,n-2}. A169587

Expansion of e.g.f. log( 1 + (exp(x) - 1)² / 2 ). A346974

Number of ways to select 4 numbers from the set of the first n natural numbers avoiding 3-term arithmetic progressions. A300760

Number of partitions of the (n+7)-multiset {0,...,0,1,2,...,7} with n 0's. A346860

Numbers k such that there are 10 digits in k² and for each factor f of 10 (1, 2, 5) the sum of digit groupings of size f is a square. A153748