Properties of the Number 20268

Twenty Thousand Two Hundred Sixty-Eight

Basics

Value: 20267 → 20268 → 20269

Parity: even

Prime: No

Previous Prime: 20261

Next Prime: 20269

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 563

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 563

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111100101100

Octal: 47454

Duodecimal: B890

Hexadecimal: 4f2c

Square: 410791824

Square Root: 142.36572621245605

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

Triangle T(n,k) in which n-th row lists the values of the n-th derivative at x=1 of all functions that are representable as x^x^...^x with n x's and parentheses inserted in all possible ways; n>=1, 1<=k<=A000081(n). A216349

Triangle T(n,k) in which n-th row lists in increasing order the values of the n-th derivative at x=1 of all functions that are representable as x^x^...^x with n x's and parentheses inserted in all possible ways; n>=1, 1<=k<=A000081(n). A216350

Numbers n such that [A070080(n), A070081(n), A070082(n)] is an obtuse isosceles integer triangle with prime side lengths. A70135

Sixth derivative of f_n at x=1, where f_n is the n-th of all functions that are representable as x^x^...^x with m>=1 x's and parentheses inserted in all possible ways. A215836

Number of Lyndon compositions (aperiodic necklaces of positive integers) with sum n and successive parts (including the last with the first part) being indivisible. A318746

∏_k>=1 1/(1 - a(k)*x^k) = 1 + ∑_k>=1 k²*x^k. A316086

Number of terms of A072873 less than or equal to 10ⁿ. A267757

a(n) is the n-th nonnegative number to light exactly n segments when displayed on a calculator. A339700

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 1, 1), (0, 1, 1), (1, 0, -1)}. A148371

a(n) = ∑_k=0..n k³ * binomial(n-k, k). A277361