Properties of the Number 21740

Twenty-One Thousand Seven Hundred Forty

Basics

Value: 21739 → 21740 → 21741

Parity: even

Prime: No

Previous Prime: 21739

Next Prime: 21751

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 1087

Divisors: 1, 2, 4, 5, 10, 20, 1087, 2174, 4348, 5435

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101010011101100

Octal: 52354

Duodecimal: 106B8

Hexadecimal: 54ec

Square: 472627600

Square Root: 147.44490496453244

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

Number of superdiagonal bargraphs with area n. A219282

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A088714. A379599

Greatest number m such that the fractional part of (1024/1000)^A153680(n) >= 1-(1/m). A153684

a(n) = [xⁿ] ((∑_k=0..n (k+7)!*x^k)/(∑_k=0..n (k+7)!*(-x)^k))^1/8. A303569

Number of binary words of length n containing at least one subword 10⁹1 and no subwords 10ⁱ1 with i<9. A143289

Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below. A78612

Number of partitions satisfying cn(0,5) < cn(2,5) + cn(3,5). A39841

a(n) = ∑_d∣n d^gcd(d,n/d). A344461

Number of (n+1) X (2+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235101

Decimal expansion of 1/736. A21740