Properties of the Number 5226

Five Thousand Two Hundred Twenty-Six

Basics

Value: 5225 → 5226 → 5227

Parity: even

Prime: No

Previous Prime: 5209

Next Prime: 5227

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 13 × 67

Divisors: 1, 2, 3, 6, 13, 26, 39, 67, 78, 134

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010001101010

Octal: 12152

Duodecimal: 3036

Hexadecimal: 146a

Square: 27311076

Square Root: 72.29107828771127

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

9-gonal (or enneagonal or nonagonal) numbers: a(n) = n*(7·n-5)/2. A1106

18-gonal (or octadecagonal) numbers: a(n) = n*(8·n-7). A51870

A triangle formed like generalized Pascal's triangle. The rule is T(n,k) = 2·T(n-1,k-1) + T(n-1,k), the left border is n and the right border is n² instead of 1. A228576

Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) is the number of permutations of [1..n] with k components. A59438

a(n) = (n⁴ + n² + 2·n)/4. A6528

Numbers k such that 3^k + 14 is prime. A219035

Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3. A64238

Number of integer partitions of n such that every orderless pair of distinct parts has a different sum. A325857

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A317823

Number of permutations of length n which avoid the patterns 321, 2143, 3124; or avoid the patterns 132, 2314, 4312, etc. A116731