Properties of the Number -110852

One Hundred Ten Thousand Eight Hundred Fifty-Two

Basics

Value: -110853 → -110852 → -110851

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 7 × 37 × 107

Divisors: 1, 2, 4, 7, 14, 28, 37, 74, 107, 148

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -11011000100000100

Octal: -330404

Duodecimal: -54198

Hexadecimal: -1b104

Square: 12288165904

Square Root: 332.94443980940724

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A251037

Difference between larger and smaller terms of n-th amicable pair. A66539

Difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933. A275469

a(n) = 1369·n² - 37. A158743

Number of (n+1)X(5+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A251034

Number of (1+1)X(n+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A251038