Properties of the Number 19682

Nineteen Thousand Six Hundred Eighty-Two

Basics

Value: 19681 → 19682 → 19683

Parity: even

Prime: No

Previous Prime: 19681

Next Prime: 19687

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 13 × 757

Divisors: 1, 2, 13, 26, 757, 1514, 9841, 19682

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100110011100010

Octal: 46342

Duodecimal: B482

Hexadecimal: 4ce2

Square: 387381124

Square Root: 140.29255147726127

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

a(n) = 3ⁿ - 1. A24023

Numbers of the form 3^m - 1 or 2·3^m - 1; i.e., the union of sequences A048473 and A024023. A62318

a(n) = n³ - 1. A68601

Numbers k such that k, k + 1 and k + 2 are 3 consecutive Harshad numbers. A154701

Array of values of Jordan function J_k(n) read by antidiagonals (version 2). A59380

Triangle T(n,m) read by rows: let p(n,x) = exp(-x) * ∑_{m >= 0} (2·m + 1)ⁿ * x^m/m!; then T(n,m) = [x^m] p(n,x). A154537

Numbers that are repdigits with length > 2 in more than one base. A167783

Table T(k, n) of smallest bases b > 1 such that p = prime(n) satisfies b^p-1 == 1 (mod p^k), read by antidiagonals. A257833

a(n) = ∑_{d∣n, n/d==1 mod 4} d⁹ - ∑_{d∣n, n/d==3 mod 4} d⁹. A321833

Array read by antidiagonals, m>=0, n>=0, A(m,n) = ∑_k=0..n ∑_j=0..m ∑_i=0..m (-1)^j+i*C(i,j)*C(n,k)^m+1*(n+1)^j*(k+1)^-j. A198060