Properties of the Number 20642

Twenty Thousand Six Hundred Forty-Two

Basics

Value: 20641 → 20642 → 20643

Parity: even

Prime: No

Previous Prime: 20641

Next Prime: 20663

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 10321

Divisors: 1, 2, 10321, 20642

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101000010100010

Octal: 50242

Duodecimal: BB42

Hexadecimal: 50a2

Square: 426092164

Square Root: 143.67324037551322

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

Powers of cube root of 2 rounded down. A17979

Numbers which converge to 2592 under repeated application of the powertrain map of A133500. A135384

O.g.f. exp( ∑_{n >= 1} A262732(n)*xⁿ/n ). A262737

Solution of the complementary equation a(n) = a(n-1) + 2·a(n-2) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences. A295146

a(n) = 2ⁿ mod n³. A233442

Largest integer terms forming a self-convolution square-root of a sequence (A132833) such that: A132833(n) <= 3·A132833(n-1) for n>0 with A132833(0)=1. A132834

Composite numbers n such that ∑_{k = 0..n} (-1)^k * C(n,k) * C(2·n,k) == -1 (mod n³) (see A234839). A268303

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

n-th composite is sum of first k composites for some k. A20642

Array read by antidiagonals: Numerical sequences of Fibonacci-like polynomials produced by m-ary Huffman trees of maximum height for absolutely ordered sequences. A98805