Properties of the Number 28494

Twenty-Eight Thousand Four Hundred Ninety-Four

Basics

Value: 28493 → 28494 → 28495

Parity: even

Prime: No

Previous Prime: 28493

Next Prime: 28499

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 1583

Divisors: 1, 2, 3, 6, 9, 18, 1583, 3166, 4749, 9498

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 110111101001110

Octal: 67516

Duodecimal: 145A6

Hexadecimal: 6f4e

Square: 811908036

Square Root: 168.80165875962237

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 distinct edges among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass. A359047

Number of nonisomorphic binary n X n matrices with two 1's per column under row and column permutations. A247417

a(n) is the number of vertices formed by n-secting the angles of a nonagon (enneagon). A335782

Array read by antidiagonals: T(m,n) = ∑_i=1..m i*(n-1+i)!. A100630

Number of different terms in a period of continued fraction for square root of n-th repunit. A96488

Table read by antidiagonals: T(m,n) gives the ordinal number in the table of permutations of length n+1 of the permutation which reverses the first m+1 items on a list of length n+1, leaving the remaining items unaltered. For example, T(5,7) is 28494 and the 28494th row of the permutation table of order 8 is 5 4 3 2 1 0 6 7. A100711

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 581", based on the 5-celled von Neumann neighborhood. A273071

Numbers n such that n·prime(n) is a pandigital number containing digits 0-9 exactly once. A272552

Fourier coefficients of the modular form (1/t_6a) * (1-12·sqrt(-3)/t_6a)^7/6 * F_6a¹⁰. A341565

G.f. A(x) satisfies: [xⁿ] A(x)ⁿ⁺¹ = [xⁿ] (1 + x·A(x)^3·n)ⁿ⁺¹ for n >= 0. A360336