Properties of the Number -151635

One Hundred Fifty-One Thousand Six Hundred Thirty-Five

Basics

Value: -151636 → -151635 → -151634

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 11 × 919

Divisors: 1, 3, 5, 11, 15, 33, 55, 165, 919, 2757

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100101000001010011

Octal: -450123

Duodecimal: -73903

Hexadecimal: -25053

Square: 22993173225

Square Root: 389.40338981575394

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 g.f. A(x) satisfying A( x·A(x)² + x·A(x)³ ) = A(x)³. A371709

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 1 or 5. A251989

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k triple descents (n>=0,0<=k<=n-3). We say that i is a triple descent of a permutation p if p(i) > p(i+1) > p(i+2) > p(i+3). A220183

Number of (n+2)X(1+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 1 or 5. A251985

Number of (n+2)X(3+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 1 or 5. A251987