Properties of the Number -151695

One Hundred Fifty-One Thousand Six Hundred Ninety-Five

Basics

Value: -151696 → -151695 → -151694

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 3371

Divisors: 1, 3, 5, 9, 15, 45, 3371, 10113, 16855, 30339

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100101000010001111

Octal: -450217

Duodecimal: -73953

Hexadecimal: -2508f

Square: 23011373025

Square Root: 389.48042312804375

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

Let a(0) = a(1) = 1, and n·a(n) = 2*(-7+5·n)*a(n-1) + 9*(2-n)*a(n-2) for n >= 2. A162326

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n k^j*binomial(n,j)*Catalan(j). A340968

Let y = y(u,v) be implicitly defined by g(u,v,y(u,v)) = 0. Read as a triangle by rows, the sequence represents the number of terms a(i,k-i) in the expansion of the bivariate divided difference [u₀,...,u_i; v₀,...,v_k-i]y in terms of trivariate divided differences of g. A172003

Triangle with first column identical to 1 and the other entries defined by the sum of entries above and to the left. A226392

Number of length n 1..(2+2) arrays with no leading or trailing partial sum equal to a prime. A254198

Number of distinct solutions of sum{i=1..4}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1. A180796