Properties of the Number 23193

Twenty-Three Thousand One Hundred Ninety-Three

Basics

Value: 23192 → 23193 → 23194

Parity: odd

Prime: No

Previous Prime: 23189

Next Prime: 23197

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 859

Divisors: 1, 3, 9, 27, 859, 2577, 7731, 23193

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101010011001

Octal: 55231

Duodecimal: 11509

Hexadecimal: 5a99

Square: 537915249

Square Root: 152.29248175796465

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 parts in all partitions of n in which no part occurs more than ten times. A320613

Number of n X 3 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 1,3,2,4,0 for x=0,1,2,3,4. A196917

Number of nX7 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A298916

Numbers whose base-4 representation contains exactly four 1's and four 2's. A45109

a(n) gives the largest number k for which there is at least one admissible k-tuple taken from [0, 1, ..., n-1] if the tuple starts with 0. Admissibility is defined in a comment. A23193

T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A298917

Iterate function described in A085308 (= reverse concatenation of prime factors); a(n) is either 1# the fixed point[=prime] if it exists at all: 2# a(2k)=1 labels that no convergence with most even initial values, in contrary mostly rapid divergence is the case; 3# a(n)=0 if n=1 or if the iteration results in nontrivial attractor with cycle length larger than one. A85308

Number of ways to choose 4 distinct points from an (n+1) X (n+1) X (n+1) lattice cube. A103157