Properties of the Number -1000000010

Ten

Basics

Value: -1000000011 → -1000000010 → -1000000009

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 2

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 17 × 5882353

Divisors: 1, 2, 5, 10, 17, 34, 85, 170, 5882353, 11764706

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -111011100110101100101000001010

Octal: -7346545012

Duodecimal: -23AA93862

Hexadecimal: -3b9aca0a

Square: 1000000020000000100

Square Root: 31622.776759797674

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

Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g., a(3k)=0. A69521

The number n written using the greedy algorithm in the base where the values of the places are 1 and primes. A7924

Smallest multiple of n with least digit sum. A77194

Smallest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists. A84013

The number n written using the minimum number of terms in the base where the values of the places are 1 and primes (noncomposites). For multiple solutions the smallest binary value is chosen. A185101

Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood. A278904

Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 390", based on the 5-celled von Neumann neighborhood. A287979

Let c(i) be the number of times the digit i appears in n, for 0 <= i <= 9; then a(n) is the concatenation of c(9) c(8) ... c(1) c(0), with leading 0's omitted. A348783

Binary expansion of n does not contain 1-bits at even positions. Integers whose base 4 representation consists of only 0's and 2s. A62033

Bit string encoding occurrence of digits of n in decimal representation: d-th bit is set iff d occurs in (n)10, 0 <= d < 10. A86067