Properties of the Number -114075

One Hundred Fourteen Thousand Seventy-Five

Basics

Value: -114076 → -114075 → -114074

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 ² × 13 ²

Divisors: 1, 3, 5, 9, 13, 15, 25, 27, 39, 45

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11011110110011011

Octal: -336633

Duodecimal: -56023

Hexadecimal: -1bd9b

Square: 13013105625

Square Root: 337.7499074759311

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) = n²*(n² - 1)/4. A6011

A partition product of Stirling₁ type [parameter k = 3] with biggest-part statistic (triangle read by rows). A157393

A partition product of Stirling₂ type [parameter k = 3] with biggest-part statistic (triangle read by rows). A157403

Triangle read by rows: T(n,k) is the number of subpermutations of an n-set, whose orbits are each of size at most k with at least one orbit of size exactly k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k with at least one orbit of size exactly k, and without fixed points. A261765

Triangular array read by rows: T(n,k) is the number of endofunctions f:{1,2,...,n}-> {1,2,...,n} whose largest component has exactly k nodes; n>=1, 1<=k<=n. A209324

Numbers whose square is both a sum and a difference of two positive cubes. A230716

a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10). A23095