Properties of the Number 4870

Four Thousand Eight Hundred Seventy

Basics

Value: 4869 → 4870 → 4871

Parity: even

Prime: No

Previous Prime: 4861

Next Prime: 4871

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 487

Divisors: 1, 2, 5, 10, 487, 974, 2435, 4870

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 1001100000110

Octal: 11406

Duodecimal: 299A

Hexadecimal: 1306

Square: 23716900

Square Root: 69.7853852894716

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

Position of first appearance of zero in the n-th differences of the nonsquarefree numbers, or 0 if it does not appear. A377050

Even pseudoprimes to base 41. A130442

Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having largest ascent k, n>=0, 0<=k<=n. A238129

Numbers n such that sum of digits of n equals the sum of digits of n³. A70276

a(n) = number of Egyptian fractions 1 = 1/x₁ + ... + 1/x_k (for any k), 0<x₁<...<x_k=n. A92669

Residues of the Lucas - Lehmer primality test for M(13) = 8191. A129221

Integers that need 7 iterations of the map x->A352172(x) to reach 1. A352265

Triangle of numbers related to the generalized Catalan sequence C(3;n+1) = A064063(n+1), n>=0. A115154

Triangle read by rows: T(n,k) is the number of ascent sequences of length n with maximal element k-1. A218577

Numbers m such that the largest digit of m³ is 5. A294665