Properties of the Number -100031

One Hundred Thousand Thirty-One

Basics

Value: -100032 → -100031 → -100030

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 67 × 1493

Divisors: 1, 67, 1493, 100031

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11000011010111111

Octal: -303277

Duodecimal: -49A7B

Hexadecimal: -186bf

Square: 10006200961

Square Root: 316.2767775224732

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) = 10ⁿ+2ⁿ-1. A155594

Integers whose decimal representation consists of three distinct digits, one appearing once, one appearing twice, and one appearing three times. A182040

a(n) = A239460(n) / n². A239463

Number of compositions of n with distinct differences up to sign. A325552

Lexicographically earliest strictly increasing decimal autovarious sequence: a(n) = number of distinct n-digit endings (left-zero-padded) of terms in the sequence. A37089

Lexicographically earliest strictly increasing base 8 autovarious sequence: a(n) = number of distinct a(k) mod 8ⁿ (written in base 8). A38117

Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9ⁿ (written in base 9). A38118

a(1) = 1, a(2) = 21; for n>2, a(n) is the least number whose neighboring digit difference forms a(n-1) such that a(n+1) also exists. A110400

a(n)³ ends in n³. A167178