Properties of the Number -2095

Ninety-Five

Basics

Value: -2096 → -2095 → -2094

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 419

Divisors: 1, 5, 419, 2095

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -100000101111

Octal: -4057

Duodecimal: -1267

Hexadecimal: -82f

Square: 4389025

Square Root: 45.77116996538323

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

Numerators of e.g.f.: tan(arccosh(x)) = cot(arcsinh(x)). A102061

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood. A270464

a(n) = ∑_{k, k∣n} 2^k-1. A34729

Indices of primes in A141523. A235862

Expansion of e.g.f. cosh(exp(x)-1). A24430

Rooted tree triangle read by rows: a(n,k) = number of forests with n nodes and k rooted trees. A33185

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 9 as largest digit. A256709

Total sum T(n,k) of the sizes of all blocks with maximal element k in all set partitions of {1,2,...,n}; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A270701

Total sum T(n,k) of the sizes of all blocks with minimal element k in all set partitions of {1,2,...,n}; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A270702

Triangle T(n,p) read by rows: the number of occurrences of p in the restricted growth functions of length n. A270236