Properties of the Number -15155

Fifteen Thousand One Hundred Fifty-Five

Basics

Value: -15156 → -15155 → -15154

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 7 × 433

Divisors: 1, 5, 7, 35, 433, 2165, 3031, 15155

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11101100110011

Octal: -35463

Duodecimal: -892B

Hexadecimal: -3b33

Square: 229674025

Square Root: 123.10564568694646

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

Triangle of coefficients of p(x,n) = (1/4)*(1-x)ⁿ⁺¹*∑_{m >= 0} ((2·m- 1)ⁿ - (2·m+3)ⁿ)*x^m, read by rows. A154852

Coefficient of xⁿ in ∏_k>=1 (1+x^k)ⁿ. A270913

Number of integer partitions of n that can be partitioned into a set of sets. A382077

Numbers using only digits 1 and 5. A276037

a(n+1) -+ a(n) = prime, a(n+1)*a(n) = average of twin prime pairs, a(1)=1, a(2)=6. A154494

Permutation of natural numbers: a(n) = A243283(A122111((2·n)-1)). A244984

Numbers n such that N = n³ is a twin rank (A002822: 6N +- 1 are twin primes). A326234

Expansion of ∏_m>=1 (1+x^m)⁸. A22573

Odd composite integers m such that A054413(m-J(m,53)) == 0 (mod m), where J(m,53) is the Jacobi symbol. A340096

Let A(n) = #{(i,j,k): i² + j² + k² <= n}, V(n) = (4/3)*π*n^3/2, P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives A(A000092(n)). A413