Properties of the Number -1004653

Four Thousand Six Hundred Fifty-Three

Basics

Value: -1004654 → -1004653 → -1004652

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 109 × 709

Divisors: 1, 13, 109, 709, 1417, 9217, 77281, 1004653

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: Yes

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11110101010001101101

Octal: -3652155

Duodecimal: -405491

Hexadecimal: -f546d

Square: 1009327650409

Square Root: 1002.3237999768338

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

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

a(n) is the smallest n-digit strong pseudoprime (in base 2). A62568

Fermat pseudoprimes to base 2 that are triangular. A293622

Strong pseudoprimes (base 2) that become prime when two is subtracted. A230483

a(n) is the smallest n-digit pseudoprime (to base 2). A68216

Least triangular number whose digit permutations yield exactly n further triangular numbers. A95870

Strong pseudoprimes k to base 2 such that either k-2 or k+2 is prime. A230487

The "non-residue" pseudoprimes: odd composite numbers n such that b(n)^(n-1/2) == -1 (mod n), where base b(n) = A020649(n). A307767

Fermat pseudoprimes to base 2 that are hexagonal. A322130