Properties of the Number -122850

One Hundred Twenty-Two Thousand Eight Hundred Fifty

Basics

Value: -122851 → -122850 → -122849

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 5 ² × 7 × 13

Divisors: 1, 2, 3, 5, 6, 7, 9, 10, 13, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -11101111111100010

Octal: -357742

Duodecimal: -5B116

Hexadecimal: -1dfe2

Square: 15092122500

Square Root: 350.4996433664377

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

a(n) = n*(n+1)*(n+2)*(n+3)/4. A33487

Smallest number with middle divisors whose distance to the next number with middle divisors is n. A280295

Numbers that are the sum of six fourth powers in eight or more ways. A345565

Numbers that are the sum of six fourth powers in exactly eight ways. A345820

Forests of k increasing plane unary-binary trees on n nodes. Generalized Stirling numbers of the second kind associated with A185415. A185422

Number of nonisomorphic proper colorings of partition star graph using six colors. A297570

Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically. A207363

a(n) = largest k such that A049820(k) <= A262509(n). A263083

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k ascents of length 4 (0<=k<=floor(n/4)). Also number of ordered trees with n edges which have k vertices of outdegree 4. A114508

a(n) is the smallest k such that ψ(k) = n!, or 0 if no such k exists (ψ(k) = A001615(k)). A291487