Properties of the Number 22893

Twenty-Two Thousand Eight Hundred Ninety-Three

Basics

Value: 22892 → 22893 → 22894

Parity: odd

Prime: No

Previous Prime: 22877

Next Prime: 22901

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 13 × 587

Divisors: 1, 3, 13, 39, 587, 1761, 7631, 22893

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 101100101101101

Octal: 54555

Duodecimal: 112B9

Hexadecimal: 596d

Square: 524089449

Square Root: 151.30432908545612

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

Numbers k such that the digits of σ(k) are a permutation of those of k, in base 10. A115920

Number A(n,k) of partitions of [k·n] into n sets of size k having at least one set of consecutive numbers whose maximum (if k>0) is a multiple of k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A370363

Numbers k such that k³ has only odd digits. A30099

Number T(n,k) of partitions of [n] having exactly k parity changes within the partition, n>=0, 0<=k<=max(0,n-1), read by rows. A363519

Expansion of ∏_k>=1 1/(1 - x^k * (1 - x)). A306749

Number of partitions of [n²] into n sets of size n having at least one set of consecutive numbers whose maximum (if n>0) is a multiple of n. A370364

Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 6. A240015

Number of length 5+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third. A248438

Numbers having four 5's in base 8. A43444

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, -1, -1), (1, 0, 0), (1, 1, 0)}. A150326