Properties of the Number 28092

Twenty-Eight Thousand Ninety-Two

Basics

Value: 28091 → 28092 → 28093

Parity: even

Prime: No

Previous Prime: 28087

Next Prime: 28097

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 2341

Divisors: 1, 2, 3, 4, 6, 12, 2341, 4682, 7023, 9364

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110110111100

Octal: 66674

Duodecimal: 14310

Hexadecimal: 6dbc

Square: 789160464

Square Root: 167.60668244434646

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

Triangle read by rows: row n (n>=0) has g.f. ∑_i=1..n n!*xⁱ*(1+x)^n-i/(n+1-i). A126671

Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.1'. A79754

List of numbers n such that A039654(n) reaches a new record high. A292113

Non-palindromic numbers n such that φ(n) = φ(reversal(n)). A97647

Number of partitions of (2, n) into a sum of distinct pairs. A268345

Number of lines through exactly 4 points of an n X n grid of points. A18811

Expansion of ∏_k>=1 ((1 + x^k²) / (1 - x^k²))^k. A291667

The sum of the necessary diagonal movements from each square unit of an n X n+1 rectangle to reach any of the corners of the rectangle. A279034

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

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, 1, -1), (1, 0, 1), (1, 1, -1), (1, 1, 0)}. A150413