Properties of the Number 42222

Forty-Two Thousand Two Hundred Twenty-Two

Basics

Value: 42221 → 42222 → 42223

Parity: even

Prime: No

Previous Prime: 42221

Next Prime: 42223

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 31 × 227

Divisors: 1, 2, 3, 6, 31, 62, 93, 186, 227, 454

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010010011101110

Octal: 122356

Duodecimal: 20526

Hexadecimal: a4ee

Square: 1782697284

Square Root: 205.47992602685062

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

a(n) = ∑_k=1..n (-1)^k-1 * binomial(k+3,4) * floor(n/k). A366939

Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UUU's (triplerises) (n >= 0; 0 <= k <= n-2 for n >= 2). A128719

If n <= 1 then n else smallest number having in decimal representation exactly one common digit with its predecessor but none with its pre-predecessor. A107277

Lunar fourth powers: n·n*n·n, where·is lunar multiplication. A87051

Number of partitions of n into even parts. A35363

Number of connected graphical partitions of 2n. A320921

Number of integer partitions of n with no pair of consecutive parts relatively prime. A328187

Irregular triangle read by rows where T(n,k) is the number of integer partitions y of n such that Sum_i prime(y_i) = k. A331416

Number of integer partitions of 2n whose distinct parts sum to n. A364910

Number of integer partitions of n with no ones such that it is not possible to choose a family of pairwise disjoint strict integer partitions, one of each part. A383711