Properties of the Number 51168

Fifty-One Thousand One Hundred Sixty-Eight

Basics

Value: 51167 → 51168 → 51169

Parity: even

Prime: No

Previous Prime: 51157

Next Prime: 51169

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 13 × 41

Divisors: 1, 2, 3, 4, 6, 8, 12, 13, 16, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011111100000

Octal: 143740

Duodecimal: 25740

Hexadecimal: c7e0

Square: 2618164224

Square Root: 226.20344824957908

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

Let S(n)=σ(|n|)-2·n; sequence gives numbers n such that S(S(S(S(n))))=n. May be called {2,1}-Sociable number of orders 1 or 2 or 4. A113285

Abundant numbers n such that n = σ(k) - 2k, where k = σ(n) - 2n. A69085

a(n) = ∑_{k=0..floor(n/2)} 2^k * binomial(2·k+1,2·n-4·k). A387765

a(0)=1. a(n) = sum of the earlier terms which are divisible by (the number of 1's in the binary representation of n). A123757

Number of 0..n arrays x(0..8) of 9 elements with zero 5th differences. A200332

Triangular array T(h,k) for 0 <= k <= h read by rows: T(h,k) = number of binary Lyndon words with k ones and h-k zeros. A51168

Run lengths of consecutive Stieltjes constants having the same sign, where the signs are A114523. A114524

The number of iterations of the map x -> A033880(x) starting at n until the a nonpositive number is reached, or 0 if this does not happen. A371921

a(n) is the number of steps to reach 0 or the start of a cycle using the iteration x -> |σ(x)-2·x| starting from x=n. A388722