Properties of the Number -1007001

Seven Thousand One

Basics

Value: -1007002 → -1007001 → -1007000

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: Yes

Factorization: 3 ² × 41 × 2729

Divisors: 1, 3, 9, 41, 123, 369, 2729, 8187, 24561, 111889

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -11110101110110011001

Octal: -3656631

Duodecimal: -406909

Hexadecimal: -f5d99

Square: 1014051014001

Square Root: 1003.4943946031786

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

Number of ordered set partitions with a designated element in each block and no block containing less than two elements. A52848

Square array A(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of e.g.f. 1/(1 - x*(exp(x) - 1)^k). A392817

Palindromes with digit sum 9. A121476

Numbers k such that k and k² use only the digits 0, 1, 4, 5 and 7. A136856

a(n) = (10ⁿ)² + 7*(10ⁿ) + 1. A225813

Palindromes that are the sum of two shorter palindromes. A62696

Triangular array read by rows. T(n,k) is the number of functional digraphs on {1,2,...,n} such that no node is at a distance greater than one from a cycle and there are k recurrent elements whose preimage contains only one element, n>=0, 0<=k<=n. A220222

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. 1/(1 - x^k/k! * (exp(x) - 1)). A355666