ℕ atory
Play Now

Properties of the Number 19893

Nineteen Thousand Eight Hundred Ninety-Three

Basics

Value: 19892 → 19893 → 19894

Parity: odd

Prime: No

Previous Prime: 19891

Next Prime: 19913

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 19 × 349

Divisors: 1, 3, 19, 57, 349, 1047, 6631, 19893

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100110110110101

Octal: 46665

Duodecimal: B619

Hexadecimal: 4db5

Square: 395731449

Square Root: 141.04254677224174

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 non-condensed integer partitions of n into parts > 1. A370804
G.f. satisfies: A(x) = 1 + x*(1-x-x2)*A(x) + x2*(3+2·x)*A(x)2. A119372
T(n,k)=Number of nXk 0..2 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly three mistakes. A278656
Number of rooted trees with n nodes and ω-valency 2. A193487
a(n) = n-1 for n <= 4, otherwise if n is even then a(n) = a(n-5)+2n/2, and if n is odd then a(n) = a(n-1)+2(n-3/2). A200310
Solution to the problem of finding the number of comparisons needed for optimal merging of 3 elements with n elements. A239100
Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 7. A244708
First of three consecutive Ulam numbers (A002858) in arithmetic progression with difference 22. A68856
Demi-tribonacci numbers (rounding down): a(0)=a(1)=0, a(2)=2; a(n) = floor( (a(n-1)+a(n-2)+a(n-3))/2 ). A180234
Number of nX2 0..2 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly three mistakes. A278650