Properties of the Number 21062

Twenty-One Thousand Sixty-Two

Basics

Value: 21061 → 21062 → 21063

Parity: even

Prime: No

Previous Prime: 21061

Next Prime: 21067

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 10531

Divisors: 1, 2, 10531, 21062

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101001001000110

Octal: 51106

Duodecimal: 10232

Hexadecimal: 5246

Square: 443607844

Square Root: 145.12753012437028

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

Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that they form a convex quadrilateral. A334711

T(n,k)=Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any diagonal or antidiagonal neighbor, and containing the value n(n+1)/2-k-1. A211963

Numerators of continued fraction convergents to sqrt(709). A42364

The number of n-digit numbers requiring 2 nonzero squares in their representation as sum of squares. A180426

a(n) = A001209(n) + 1. A196069

Numerators of convergents to Khinchin's constant. A127005

Convolution of natural numbers with (1, p(1), p(2), ... ), where p(k) is the k-th prime. A23538

Decimal part of n^1/11 starts with a 'nine digits' anagram. A34286

Number of partitions of n into at most 1² copy of 1, 2² copies of 2, 3² copies of 3, ... . A303944

a(n) is the number of ways to express 2·n+1 as a sum of parts·such that x+2 is an odd prime. A333615