Properties of the Number -3628811

Six Hundred Twenty-Eight Thousand Eight Hundred Eleven

Basics

Value: -3628812 → -3628811 → -3628810

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 3628811

Divisors: 1, 3628811

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -1101110101111100001011

Octal: -15657413

Duodecimal: -127000B

Hexadecimal: -375f0b

Square: 13168269273721

Square Root: 1904.9438311929305

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

Smallest prime > n!. A37151

Primes of the form (p - 1)! + p, p prime. A100858

a(n) = 1·2*3·4*5·6*7·8*9·10 + 11·12·13·14·15·16·17·18·19·20 + 21·22·23·24·25·26·27·28·29·30 + ... + (up to n). A319212

Irregular triangle read by rows: row n (n>=1) lists the primes of the form prime(n) + k! for k >= 0. A352912

Smallest prime > n!+1. A37152

Smallest prime >= n!. A87421

a(n) = greatest prime factor of (prime(n) - 1)! + prime(n). A100857

a(n) = the minimum prime S possible, if S = product of b(k)'s + product of c(k)'s, where the distinct positive integers <= n are partitioned into the two sets {b(k)} and {c(k)}. a(n) = 0 if no prime S exists for that n. A127166

a(n) = (n-1)! * ∑_d∣n d/(d-1)!. A370580

Upper balancing primes to prime-balanced factorials. A53713