Properties of the Number -1835

Eight Hundred Thirty-Five

Basics

Value: -1836 → -1835 → -1834

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 367

Divisors: 1, 5, 367, 1835

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11100101011

Octal: -3453

Duodecimal: -108B

Hexadecimal: -72b

Square: 3367225

Square Root: 42.83689998120779

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

Expansion of (1 + x + x²)/(1 - x³ + x⁴). A124750

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

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

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

a(n) = (2·n-1)*(13·n²-13·n+6)/6. A63493

T(n,k) = number of n X k 0..5 arrays with values 0..5 introduced in row major order and no element equal to any horizontal or vertical neighbor. A198982

Number T(n,k) of permutations p of [n] such that the up-down signature of p has nonnegative partial sums with a maximal value of k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A262125

Number of integer partitions of n whose distinct consecutive subsequences have different sums. A325769

a(0)=1. a(n) = a(n-1)*2, if n is in the sequence. a(n) = a(n-1) + 1 if n is missing from the sequence. A118551

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically. A207111