Properties of the Number -362881

Three Hundred Sixty-Two Thousand Eight Hundred Eighty-One

Basics

Value: -362882 → -362881 → -362880

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 19 × 71 × 269

Divisors: 1, 19, 71, 269, 1349, 5111, 19099, 362881

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1011000100110000001

Octal: -1304601

Duodecimal: -156001

Hexadecimal: -58981

Square: 131682620161

Square Root: 602.3960491238302

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

Triangle T(n,k) = A008297(n,k) + A008297(n,n-k+1), read by rows. A169653

Triangle T(n, k) = A176013(n, k) + A176013(n, n-k+1), read by rows. A176022

a(n) = (-1)ⁿ*(n! - (-1)ⁿ). A235378

a(n) = n! + 1. A38507

Sum of factorials of the digits of n. A61602

a(1) = 0, a(n) = (e1·i1! + e2·i2! + ... + ez·iz!) for n = prime(i1)^e1 * prime(i2)^e2 * ... * prime(iz)^ez, where prime(k) is the k-th prime, A000040(k). A276075

a(n) = (n!+10)/10. A139157

Number of non-normal (0,1) semi-magic squares with sum of entries equal to n. A321720

Composite squarefree numbers k such that p+1 divides k-1 for any prime p dividing k. A225711

Triangle T(n,k) giving the smallest term in "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k. A230428