Properties of the Number -808393

Eight Hundred Eight Thousand Three Hundred Ninety-Three

Basics

Value: -808394 → -808393 → -808392

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 19 × 157 × 271

Divisors: 1, 19, 157, 271, 2983, 5149, 42547, 808393

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

375 Try Today's Challenge

Representations

Binary: -11000101010111001001

Octal: -3052711

Duodecimal: -32B9A1

Hexadecimal: -c55c9

Square: 653499242449

Square Root: 899.1067789756676

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·a(n-1) + (n-2)*a(n-2), with a(0) = 0, a(1) = 1. A153

Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n). A76731

Triangular array formed from successive differences of factorial numbers, then with factorials removed. A60475

Array read by upwards antidiagonals: T(n,k) is the number of ways to place n persons on different seats such that each person number p, 1 <= p <= n, differs from the seat number s(p), 1 <= s(p) <= n+k, k >= 0. A336246

Triangle read by rows: T(n, k) = (∑_i=0..n-k (-1)ⁱ * binomial(n-k, i) * (n+2-i)!) * binomial(n, k) / ((k+1) * (k+2)) for 0 <= k <= n. A373050