Properties of the Number -225696

Two Hundred Twenty-Five Thousand Six Hundred Ninety-Six

Basics

Value: -225697 → -225696 → -225695

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 2351

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -110111000110100000

Octal: -670640

Duodecimal: -AA740

Hexadecimal: -371a0

Square: 50938684416

Square Root: 475.0747309634559

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 (read by rows) of coefficients of the polynomials (in ascending order) of the denominators of the generalized sequence of fractions f(n) defined recursively by f(1) = m/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal. A225200

Triangle, read by rows, where row n lists the coefficients of x^k, k=1..2ⁿ, in the n-th iteration of (x + x²) for n>=0. A122888

Sum of divisors of n and product of divisors of n are both perfect cubes. A244428

Triangle (read by rows) of coefficients of the polynomials (in ascending order) of the denominators of the generalized sequence s(n) of the sum resp. product of generalized fractions f(n) defined recursively by f(1) = m/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal. A225201