Properties of the Number -11357

Eleven Thousand Three Hundred Fifty-Seven

Basics

Value: -11358 → -11357 → -11356

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 41 × 277

Divisors: 1, 41, 277, 11357

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110001011101

Octal: -26135

Duodecimal: -66A5

Hexadecimal: -2c5d

Square: 128981449

Square Root: 106.56922632730333

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 partitions of n such that the successive differences of consecutive parts are nondecreasing. A240026

Floor of concatenation of n, n+1, n+2, n+3, n+4 divided by 5. A74995

T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column divisible by 13, read as a binary number with top and left being the most significant bits. A262488

a(n) = 10·n² - 6·n + 1. A87348

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 182", based on the 5-celled von Neumann neighborhood. A279697

a(n) = a(n-1)+ a(round(2*(n-1)/3)) +a(round((n-1)/3)) starting a(1)=1. A33498

a(n) = ceiling(log(n)*2ⁿ/n). A65615

a(n) = n·F(n) - (n-1)*F(n-1), where the F(j)'s are the Fibonacci numbers (F(0)=0, F(1)=1). A136391

Least integer k such that k/2ⁿ > log 2. A293363

The integer k that minimizes |k/2ⁿ - log 2|. A293364