Properties of the Number -1088641

Eighty-Eight Thousand Six Hundred Forty-One

Basics

Value: -1088642 → -1088641 → -1088640

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 1088641

Divisors: 1, 1088641

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

375 Try Today's Challenge

Representations

Binary: -100001001110010000001

Octal: -4116201

Duodecimal: -446001

Hexadecimal: -109c81

Square: 1185139226881

Square Root: 1043.3796049377236

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) = 3·n! + 1. A173324

Minimal factorial safe-primes: a prime p = a(n) here if (p-1)/n! = A051888(n). A51901

Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows. A174690

Triangle T(n, k) = n!*(1/k)*binomial(n-1, k-1)*binomial(n, k-1) - n! + 1, read by rows. A174694

Triangular array read by rows: T(n,k) = n!*k + 1, n >= 1, 1 <= k <= n. A362777

Triangular array read by rows: T(n,k) is the least prime factor of n!*k + 1, n >= 1, 1 <= k <= n. A362778

Triangular array read by rows: T(n,k) is the greatest prime factor of n!*k + 1, n >= 1, 1 <= k <= n. A362779

Primes of the form 3·k! + 1. A62551

Prime numbers arising from Schorn's proof that there are infinitely many primes. A104189

Triangle, read by rows, T(n, k) = T(n, k-1) + (k+1)*n!, T(n, 0) = 1. A105064