Properties of the Number -117001

One Hundred Seventeen Thousand One

Basics

Value: -117002 → -117001 → -117000

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 23 × 5087

Divisors: 1, 23, 5087, 117001

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11100100100001001

Octal: -344411

Duodecimal: -57861

Hexadecimal: -1c909

Square: 13689234001

Square Root: 342.0540892899835

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) = 1 + 2·n + n² + 2·n³ + n⁴. A165563

Composites in base 10 that remain composite in exactly four bases b, 2 <= b <= 10, expansions interpreted as decimal numbers. A256354

a(2n)=A165568(n). a(2n+1)=A165563(n). A171733

Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k hills (i.e., ud's starting at level 0). (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).). A109191

Number of Grand Motzkin paths of length n and having no hills (i.e., no ud's starting at level 0). (A Grand Motzkin path of length n is a path in the half-plane x >= 0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).) A109192

Number of binary strings of length n with equal numbers of 00100 and 01101 substrings. A164238

a(n) = numerator of ∑_d∣n (d/pod(d)) where pod(k) = the product of the divisors of k (A007955). A324505