Properties of the Number -11395

Eleven Thousand Three Hundred Ninety-Five

Basics

Value: -11396 → -11395 → -11394

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 43 × 53

Divisors: 1, 5, 43, 53, 215, 265, 2279, 11395

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10110010000011

Octal: -26203

Duodecimal: -6717

Hexadecimal: -2c83

Square: 129846025

Square Root: 106.74736530706507

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

Consider the triangle in which the n-th row starts with n, contains n terms and the difference of successive terms is 1,2,3,... up to n-1. Sequence gives row sums. A81498

Number of partitions of n into squarefree parts. A73576

Number of partitions of 2n in which every part is <n+1; also, the number of partitions of 2 into rational numbers a/b such that 0<a<=b<=n and b divides n. A209816

Number of partitions of n with no part larger than n/2. Also partitions of n into n/2 or fewer parts. A110618

Number of integer partitions of n whose greatest part is at most one more than the sum of the other parts. A336106

a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n-k+1), where k = [ n/2 ], p = A000040, the primes. A25129

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array. A219816

a(n) = T(n,n-5), array T as in A055807. A55810

Number of ways of pairing numbers 1 to n with numbers n+1 to 2n such that each pair sums to a prime. A70897

Pell pseudoprimes: odd composite numbers n such that P(n)-Kronecker(2,n) is divisible by n. A99011