ℕ atory
Play Now

Properties of the Number 28486

Twenty-Eight Thousand Four Hundred Eighty-Six

Basics

Value: 28485 → 28486 → 28487

Parity: even

Prime: No

Previous Prime: 28477

Next Prime: 28493

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 14243

Divisors: 1, 2, 14243, 28486

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110111101000110

Octal: 67506

Duodecimal: 1459A

Hexadecimal: 6f46

Square: 811452196

Square Root: 168.77796064652517

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231419
a(n) is the number of regions formed by n-secting the angles of a nonagon (enneagon). A335781
Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)). A33861
Number of walks of length n on the square lattice that start from (0,0) and do not touch the half-line {x=y, x <= 0} once they have left their starting point. A53792
Number of (n+1)X(5+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231417
Number of (1+1) X (n+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231420
Number of simple involutions of length n. A244522
Composite numbers k such that φ(x) = ψ(k)*φ(k) has no solution. A292714
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 1, -1), (1, -1, 0), (1, 0, 1)}. A148609
Number of perfect matchings in graph C15 X P2n. A28486