Properties of the Number 43221

Forty-Three Thousand Two Hundred Twenty-One

Basics

Value: 43220 → 43221 → 43222

Parity: odd

Prime: No

Previous Prime: 43207

Next Prime: 43223

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 14407

Divisors: 1, 3, 14407, 43221

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010100011010101

Octal: 124325

Duodecimal: 21019

Hexadecimal: a8d5

Square: 1868054841

Square Root: 207.89660891895278

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 partitions of n such that the (sum of distinct odd parts) <= n/2. A284613

Number of mutual-visibility sets in the n-prism graph. A389184

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (F(2), F(3), F(4), ...). A25103

Number of partitions of n-1 boys and one girl with no couple. A120452

Number of integer partitions of n whose negated run-lengths are not unimodal. A332639

Number of integer partitions of n with an alternating permutation covering an initial interval of positive integers. A345163

Number of integer partitions of n that cannot be partitioned into constant multisets with distinct block-sums. A381717

Number of connected graphical partitions of 2n. A320921

Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) = number of partitions of 2n into 2k odd parts. A152146

Number of integer partitions of n whose run-lengths are neither weakly increasing nor weakly decreasing. A332641