Properties of the Number 24893

Twenty-Four Thousand Eight Hundred Ninety-Three

Basics

Value: 24892 → 24893 → 24894

Parity: odd

Prime: No

Previous Prime: 24889

Next Prime: 24907

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 11 × 31 × 73

Divisors: 1, 11, 31, 73, 341, 803, 2263, 24893

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000100111101

Octal: 60475

Duodecimal: 124A5

Hexadecimal: 613d

Square: 619661449

Square Root: 157.77515647274763

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 (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the absolute difference of its antidiagonal elements. A251055

Numbers b > 1 such that the smallest four primes, i.e., 2, 3, 5 and 7 are base-b Wieferich primes. A339533

Number of nX4 -1,1 arrays such that the sum over i=1..n,j=1..4 of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 4-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship). A225340

Number of 10Xn -1,1 arrays such that the sum over i=1..10,j=1..n of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute n-across galley oarsmen left-right at 10 fore-aft positions so that there are no turning moments on the ship). A225350

Number of (n+1) X (3+1) 0..3 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the absolute difference of its antidiagonal elements. A251050

Number of (n+1)X(4+1) 0..3 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the absolute difference of its antidiagonal elements. A251051

a(1) = 1 then the least multiple of odd numbers not odd multiples of 5, (3,7,9,11,13,17,19,21,23,27,29,...) such that every partial concatenation is noncomposite. A110433

Numbers k such that 3·k+2 is prime. A24893

T(n,k) = Number of n X k {-1,1}-arrays such that the sum over i=1..n,j=1..k of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute k-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship). A225345

Permanent of the (0,1)-matrix with ij-th entry equal to zero iff (i=1,j=1),(i=1,j=2),(i=1,j=3),(i=2,j=3),(i=3,j=3),... In other words, the ij-th entry of the matrix is zero iff it is on the path which start from the entry (i=1,j=1) and moves in the matrix alternating 3 steps to the right to 3 steps down. A98926