Properties of the Number 1422

One Thousand Four Hundred Twenty-Two

Basics

Value: 1421 → 1422 → 1423

Parity: even

Prime: No

Previous Prime: 1409

Next Prime: 1423

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 79

Divisors: 1, 2, 3, 6, 9, 18, 79, 158, 237, 474

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10110001110

Octal: 2616

Duodecimal: 9A6

Hexadecimal: 58e

Square: 2022084

Square Root: 37.70941526992961

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 if there are two kinds of 1's and two kinds of 2's. A97

First differences of A006128. A138137

Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951). A1522

Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0)=1, T(n,k)=0 if n < k, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1). A64189

Motzkin triangle, T, read by rows; T(0,0) = T(1,0) = T(1,1) = 1; for n >= 2, T(n,0) = 1, T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k) for k = 1,2,...,n-1 and T(n,n) = T(n-1,n-2) + T(n-1,n-1). A26300

A246604 (Catalan(n)-n) with initial terms 1,0,0,2,10 changed to 1,1,1,2,11. A289616

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of ∏_j>=1 1/(1 - j·x^j)^k. A297328

Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k fixed points, k = 0, 1. A352833

Binomial transform of the number of partitions into distinct parts (A000009). A266232

Numbers m such that there are precisely 16 groups of order m. A295161