Properties of the Number 5058

Five Thousand Fifty-Eight

Basics

Value: 5057 → 5058 → 5059

Parity: even

Prime: No

Previous Prime: 5051

Next Prime: 5059

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 281

Divisors: 1, 2, 3, 6, 9, 18, 281, 562, 843, 1686

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001111000010

Octal: 11702

Duodecimal: 2B16

Hexadecimal: 13c2

Square: 25583364

Square Root: 71.11961754677819

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

Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=5. A135190

a(n) = A031287(n) + A031288(n) + A031289(n) + A031290(n) + A031291(n) + A031292(n) + A031293(n) + A031294(n) + A031295(n) + A031296(n). A193428

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

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

Partial sums of A068058 + 1. A68059

T(n,k) = number of n X k 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero. A231080

Number of Feynman diagrams (vanishing and non-vanishing) of order 2n for the proper self-energy function of quantum electrodynamics (QED). A115974

Expansion of x/((1-x-x³)*(1-x)⁵). A144899

a(1) = 668; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1). A105212

T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero. A230805