Properties of the Number 10893

Ten Thousand Eight Hundred Ninety-Three

Basics

Value: 10892 → 10893 → 10894

Parity: odd

Prime: No

Previous Prime: 10891

Next Prime: 10903

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 3631

Divisors: 1, 3, 3631, 10893

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101010001101

Octal: 25215

Duodecimal: 6379

Hexadecimal: 2a8d

Square: 118657449

Square Root: 104.36953578511309

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

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A280673

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... . A186754

Number of nX2 0..1 arrays with every element unequal to 0, 1, 2 or 3 king-move adjacent elements, with upper left element zero. A303721

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 3 king-move adjacent elements, with upper left element zero. A303727

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3 or 7 king-move adjacent elements, with upper left element zero. A304775

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3 or 8 king-move adjacent elements, with upper left element zero. A305230

Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), k >= 3. A33937

Expansion of e.g.f. exp(x·cos(2·x)). A381275

a(0)=1, a(n) = a(n-1) + a(2·n AND n), where AND is the bitwise AND operator. A215488

Expansion of e.g.f. cosh(log(1+x))*cos(x). A9128