Properties of the Number -362878

Three Hundred Sixty-Two Thousand Eight Hundred Seventy-Eight

Basics

Value: -362879 → -362878 → -362877

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 2 × 181439

Divisors: 1, 2, 181439, 362878

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1011000100101111110

Octal: -1304576

Duodecimal: -155BBA

Hexadecimal: -5897e

Square: 131680442884

Square Root: 602.3935590625119

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

Ordered differences of factorials. A204930

Numbers k such that k divides the sum of digits in factorial base of all numbers from 1 to k. A333702

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k as the last entry in the first block (1<=k<=n). A177263

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k as the first entry in the last block (1<=k<=n). A177264

Differences of two factorial numbers. A51949

Number of permutations of {1..n} with fewer than 7 interior elements having values lying between the values of their neighbors. A226440

Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than 7 times. A248841

a(n) = n! - 2. A261193

Triangle read by rows: T(n, k) is the number of permutations of length n, which contain the maximum number of distinct patterns of length k. A373877

A recursive triangular sequence with row sums (2*(n + 5)!): A(n,k)=A(n - 1, k - 1) + A(n - 1, k) + (n + 4)*(n + 3)*A(n - 2, k - 1). A153737