Properties of the Number -314821

Three Hundred Fourteen Thousand Eight Hundred Twenty-One

Basics

Value: -314822 → -314821 → -314820

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 61 × 397

Divisors: 1, 13, 61, 397, 793, 5161, 24217, 314821

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: Yes

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001100110111000101

Octal: -1146705

Duodecimal: -132231

Hexadecimal: -4cdc5

Square: 99112262041

Square Root: 561.0891194810322

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

Carmichael numbers: composite numbers k such that a^k-1 == 1 (mod k) for every a coprime to k. A2997

Strong pseudoprimes to base 2. A1262

3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p·q*r, where p < q < r are primes such that a^k-1 == 1 (mod k) if a is prime to k. A87788

Composite numbers k congruent to 5 (mod 8) such that 2^(k-1/2) mod k = k-1. A244626

Terms of A324315 (squarefree integers m > 1 such that if prime p divides m, then the sum of the base p digits of m is at least p) that are also hexagonal numbers (A000384) with index equal to their largest prime factor. A324319

Pseudoprimes to bases 2, 3 and 5. A83737

Composite integers k such that 2^k == 2 (mod k*(k+1)). A217465

Fermat pseudoprimes to base 2 that are triangular. A293622

Carmichael numbers ending in 1. A354609

Pseudoprimes to bases 2, 3, 5 and 7. A83739