Properties of the Number 20356

Twenty Thousand Three Hundred Fifty-Six

Basics

Value: 20355 → 20356 → 20357

Parity: even

Prime: No

Previous Prime: 20353

Next Prime: 20357

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 7 × 727

Divisors: 1, 2, 4, 7, 14, 28, 727, 1454, 2908, 5089

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111110000100

Octal: 47604

Duodecimal: B944

Hexadecimal: 4f84

Square: 414366736

Square Root: 142.67445461609447

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 formed when the cumulative boustrophedon transform is applied to 1, 1, 1, 1, ..., read by rows from left to right. A59433

Triangle formed when cumulative boustrophedon transform is applied to 1, 1, 1, 1, ..., read by rows in natural order. A59434

Number of integer partitions of 2n with exactly n distinct sums of nonempty submultisets. A365660

Number of partitions of n such that the number of parts and the largest part and the smallest part are pairwise coprime. A201218

Integers k equal to the sum over A024816(t) mod t, for some steps, starting with t = k and then using the result to feed the next calculation. A377002

Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3. A27557

Number of permissible patterns of primes in a fixed interval of n consecutive integers. A94660

Number of -n..n arrays x(0..4) of 5 elements with zero sum and no element more than one greater than the previous. A199849

Irregular triangular array read by rows. T(n,k) is the number of simple labeled graphs on [n] with circuit rank equal to k, n >= 1, 0 <= k <= binomial(n-1,2). A372153

A Binet like formula using the Akiyama-Thurston tile roots for a Minimal Pisot theta0 sequence. A97600