Properties of the Number -51850

Fifty-One Thousand Eight Hundred Fifty

Basics

Value: -51851 → -51850 → -51849

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 ² × 17 × 61

Divisors: 1, 2, 5, 10, 17, 25, 34, 50, 61, 85

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1100101010001010

Octal: -145212

Duodecimal: -2600A

Hexadecimal: -ca8a

Square: 2688422500

Square Root: 227.705950734714

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

Number of singular 2 X 2 matrices over Z(n) (i.e., with determinant = 0). A20478

For every positive integer m, let u(m) = (d(1),d(2),...,d(k)) be the unitary divisors of m. The sequence (a(n)) consists of integers of the form d(k)/d(1) + d(k-1)/d(2) + ... + d(k)/d(1). A229999

Primitive nondeficient numbers satisfying a stronger condition that compares abundancy with related numbers as detailed in the comments. A352739

Numbers k such that the sum of the Carmichael λ functions of the divisors is a proper divisor of k. A131492

Primitive abundant numbers version 2 (abundant numbers all of whose proper divisors are deficient numbers) and increasing any prime factor in the prime factorization gives a non-abundant number when factored back. A335557

Number of cells in a regular 7-gon after n generations of mitosis. A349808

a(n) is the least number k such that there is a set of n proper divisors of k whose sum is k, and no set of fewer than n proper divisors of k whose sum is k. A389712

Write the numbers from 1 to n² in a spiraling square; a(n) is the total of the sums of the two diagonals. A59924

a(n) = 10ⁿ mod 3ⁿ. A139734

Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically. A207449