Properties of the Number -10755

Ten Thousand Seven Hundred Fifty-Five

Basics

Value: -10756 → -10755 → -10754

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 239

Divisors: 1, 3, 5, 9, 15, 45, 239, 717, 1195, 2151

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10101000000011

Octal: -25003

Duodecimal: -6283

Hexadecimal: -2a03

Square: 115670025

Square Root: 103.70631610466162

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

Number of not necessarily connected 4-regular simple graphs on n vertices with girth exactly 3. A185143

Triangular array E(n,k) counting, not necessarily connected, k-regular simple graphs on n vertices with girth exactly 3. A185643

Expansion of ∏_k>=1 (∏_j=1..k (1 + x^k·j)^j). A327063

Number of partitions of n into distinct parts with boundary size 6. A227563

The number of solutions to φ(x) = φ(x+1) below 10ⁿ, where φ(x) is the Euler totient function. A300285

Number of n element multisets of the 15th roots of unity with zero sum. A321418

a(n) = A337339(n) - n. A337341

a(n) is the number of ways to partition a square n X n into five rectangles of different dimensions, without any straight cut spanning the entire square. A384208

A106486-encodings of combinatorial games equivalent to game {0∣0}. A125994

Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth exactly g. A185140