Properties of the Number -10010

Ten Thousand Ten

Basics

Value: -10011 → -10010 → -10009

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 2

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 7 × 11 × 13

Divisors: 1, 2, 5, 7, 10, 11, 13, 14, 22, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -10011100011010

Octal: -23432

Duodecimal: -5962

Hexadecimal: -271a

Square: 100200100

Square Root: 100.0499875062461

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

G.f. satisfies: A(x) = 1/(1 + x·A(x⁷)) and also the continued fraction: 1 + x·A(x⁸) = [1; 1/x, 1/x⁷, 1/x⁴⁹, 1/x³⁴³, ..., 1/x^{7^(n-1}), ...]. A101917

Coefficient array for certain polynomials N(5; k,x) (rising powers in x). A62986

The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2. A7088

Representation of n in base of Fibonacci numbers (the Zeckendorf representation of n). Also, binary words starting with 1 not containing 11, with the word 0 added. A14417

Sums of two powers of 10. A52216

a(n) is the negabinary expansion of n, that is, the expansion of n in base -2. A39724

Least positive multiple of n that when written in base 10 uses only 0's and 1's. A4290

Binary vectors not containing three consecutive 1's; or, representation of n in the tribonacci base. A278038

a(n) = a(n-1) + a(n-7), with a(i) = 1 for i = 0..6. A5709

Products of exactly 5 distinct primes. A46387