ℕ atory
Play Now

Properties of the Number 4898

Four Thousand Eight Hundred Ninety-Eight

Basics

Value: 4897 → 4898 → 4899

Parity: even

Prime: No

Previous Prime: 4889

Next Prime: 4903

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 31 × 79

Divisors: 1, 2, 31, 62, 79, 158, 2449, 4898

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1001100100010

Octal: 11442

Duodecimal: 2A02

Hexadecimal: 1322

Square: 23990404

Square Root: 69.98571282769076

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 T(n,k), n>=1, 0<=k<=n2, read by rows: row n gives the coefficients of the chromatic polynomial of the rhombic hexagonal square grid graph RHn,n, highest powers first. A212162
Iterate the map in A006369 starting at 144. A185589
Trajectory of 64 under the map n-> A006369(n). A223083
Triangle T(n,k), n>=1, 0<=k<=n2, read by rows: row n gives the coefficients of the chromatic polynomial of the staggered hexagonal square grid graph SHn,n, highest powers first. A212194
T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row divisible by 5 and column not divisible by 5, read as a binary number with top and left being the most significant bits. A262795
Number of right triangles of a given area required to form successively larger squares. A60626
Number of heptagonal regions in regular n-gon with all diagonals drawn. A67154
a(n) is the number of canonical polygons with 4n edges having exactly 4 lines of reflection symmetry. A307519
Numbers k such that s(k) = s(k+1) where s(k) is the sum of divisors of k that are smaller than sqrt(k) (A070039). A324295
Irregular triangle: T(n,k) gives the number of k-polysticks on edges of the n-cube up to rotational symmetries of the n-cube, with 0 <= k <= A001787(n). A383799