ℕ atory
Play Now

Properties of the Number -10275

Ten Thousand Two Hundred Seventy-Five

Basics

Value: -10276 → -10275 → -10274

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 2 × 137

Divisors: 1, 3, 5, 15, 25, 75, 137, 411, 685, 2055

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10100000100011

Octal: -24043

Duodecimal: -5B43

Hexadecimal: -2823

Square: 105575625

Square Root: 101.36567466356647

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

McKay-Thompson series of class 30a for Monster. A58619
Triangular array T(n, k) read by rows: polynomials for the series expansion of the iterated function Ft(x) = ∑n>=0 (1/x)2·n-1*Pn(t)/n! with F1(x) = (x + sqrt(x2 + 4))/2 and F2(x) = F1(F1(x)). Row n of the triangle give the coefficients of the polynomial Pn(t). A390822
Numbers m such that there are precisely 3 groups of order m. A55561
Numbers n such that the decimal expansions of both n and n2 have 0 as smallest digit and 7 as largest digit. A256634
Number of unlabeled triangle-free graphs covering n vertices. A372169
Coefficients in the expansion of C/B2, in Watson's notation of page 106. A160461
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..3 introduced in row major order. A205440
Number of integer partitions of n whose length is not a semi-sum of the parts. A367398
Number of non-isomorphic set-systems of weight n with at least one singleton. A330053
a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 1. Also a(n) = T(n,n-1), where T is the array defined in A024996. A24998