Properties of the Number 19693

Nineteen Thousand Six Hundred Ninety-Three

Basics

Value: 19692 → 19693 → 19694

Parity: odd

Prime: No

Previous Prime: 19687

Next Prime: 19697

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 47 × 419

Divisors: 1, 47, 419, 19693

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110011101101

Octal: 46355

Duodecimal: B491

Hexadecimal: 4ced

Square: 387814249

Square Root: 140.33174979312415

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) = ∑_k=1..n k^n-k*binomial(n-1,k-1). A80108

Sum of 11 positive 9th powers. A4800

Rectangular array of coefficients in successive iterations of x·exp(x), as read by antidiagonals. A174480

a(1) = 1; for n>1, a(n) = least k such that concatenation of n copies of k with all previous concatenations gives a prime. A111471

Number of distinct positive integers that can be obtained by iteratively adding any two or multiplying any two non-1 parts of an integer partition until only one part remains, starting with 1ⁿ. A319909

Numbers n such that σ(φ(n))/σ(n) = 2. A67382

Euler-Seidel matrix T(k,n) with start sequence A000248, read by antidiagonals. A98697

a(n) = n² - 917·n + 9479. A161726

Members of a pair (m,n) such that σ(m) = σ(n) = σ(n-m), m < n where σ = A000203. A239939

Numbers k such that k, k+1, k+2, k+3 have 2, 3, 4, 5 prime factors respectively, counted with multiplicity. A363391