Properties of the Number -50610

Fifty Thousand Six Hundred Ten

Basics

Value: -50611 → -50610 → -50609

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 7 × 241

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100010110110010

Octal: -142662

Duodecimal: -25356

Hexadecimal: -c5b2

Square: 2561372100

Square Root: 224.966664197165

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

9-gonal (or enneagonal) pyramidal numbers: a(n) = n*(n+1)*(7·n-4)/6. A7584

a(n) = n⁴ - n. A58895

A sum over partitions (q=15), see first comment. A221582

Numbers k having exactly 5 distinct prime factors, the largest of which is greater than or equal to sqrt(k) (i.e., sqrt(k)-rough numbers with exactly 5 distinct prime factors). A115959

Integers having ideal digital mean up to base 5. A144800

Diagonal sums of number array A082105. A82107

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1. A49942

Numbers whose set of base 15 digits is {0,E}, where E base 15 = 14 base 10. A97261

Number of ordered ways of writing the n-th n-gonal number as a sum of n nonzero n-gonal numbers. A335634

a(n) = 225·n² - n. A156813