Properties of the Number -101031

One Hundred One Thousand Thirty-One

Basics

Value: -101032 → -101031 → -101030

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 17 × 283

Divisors: 1, 3, 7, 17, 21, 51, 119, 283, 357, 849

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11000101010100111

Octal: -305247

Duodecimal: -4A573

Hexadecimal: -18aa7

Square: 10207262961

Square Root: 317.8537399496819

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

Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished. A49020

Times on a 12-hour digital clock with 6 digits at which the three continuously moving hands of an analog clock, in the best approximation, enclose the same angles with one another, i.e., have the smallest sum of squares of the deviations from 120 degrees. When interpreting the terms as times of the day in the form hh:mm:ss, padding to the left with zeros is assumed. A347040

E.g.f.: exp(exp(x) - 1) * (exp(x) - 1)⁴ / 4!. A346843

Number of permutations of length n which avoid the patterns 1243, 2341, 4321. A116825

Triangle read by rows: T(n,k) = ∑_j=k..n binomial(n,j)*Stirling₂(j,k)*Bell(n-j), where Bell(n) = A000110(n), for n >= 1, 0 <= k <= n-1. A244489

Numbers whose base-10 representation has exactly 6 runs. A43642