Properties of the Number 19368

Nineteen Thousand Three Hundred Sixty-Eight

Basics

Value: 19367 → 19368 → 19369

Parity: even

Prime: No

Previous Prime: 19333

Next Prime: 19373

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 269

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101110101000

Octal: 45650

Duodecimal: B260

Hexadecimal: 4ba8

Square: 375119424

Square Root: 139.16896205691842

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 nonempty subsets of {2..n} whose product is divisible by their sum. A326172

Keys added to a map T initialized with T[1] = 1 and updated at each iteration according to T[value] := (T[value] if defined else 0) + key, for all (key, value) pairs already in T; listed in order the keys are added to the map (cf. comments for details). A390939

Positions of 3's in A234323. A234804

Molien series for 9-dimensional group of structure Z₂ X Z₂ and order 4, corresponding to complete weight enumerators of Hermitian self-dual GF(3)-linear codes over GF(9). A92091

Positive numbers k such that k and k + 1 are both positive negaFibonacci-Niven numbers (A331085) and -k and -(k + 1) are both negative negaFibonacci-Niven numbers (A331088). A331092

Value of T[4] after the n-th iteration, when the map T is initialized with T[1] = 1 and in subsequent iterations, T[v] = k + (T[v] if defined else 0) for all key-value pairs (k, v) in T; a(n) = 0 if T[4] isn't defined yet. A390944

Number of (n+1) X (5+1) 0..3 arrays with every 2 X 2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 9. A234137

Number of (n+1) X (7+1) 0..3 arrays with every 2 X 2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 9. A234139

Number of nX4 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2. A275500

Consider all 3 X 3 matrices M whose entries are the n-th to (n+8)-th primes prime(n), ..., prime(n+8), in any order. a(n) is the sum of the number of M such that det(M) is divisible by prime(n+i), for i from 0 to 8. A339105