Properties of the Number -35925

Thirty-Five Thousand Nine Hundred Twenty-Five

Basics

Value: -35926 → -35925 → -35924

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ² × 479

Divisors: 1, 3, 5, 15, 25, 75, 479, 1437, 2395, 7185

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000110001010101

Octal: -106125

Duodecimal: -18959

Hexadecimal: -8c55

Square: 1290605625

Square Root: 189.53891421024866

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

Numbers k such that 9·R_k - 8 is prime, where R_k = 11...1 is the repunit (A002275) of length k. A95714

Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded. A85844

a(n) = ∑_{1 <= x₁, x₂, x₃ <= n} n/gcd(x₁, x₂, x₃, n). A372952

Number of inequivalent maximal antichains of the Boolean lattice on a set of n elements. A348260

Expansion of (A(x)²+A(x²))/2 where A(x) = A001006(x). A275207

a(n) = 2ⁿ + 5ⁿ + 8ⁿ. A74539

a(1)=1, a(2)=2; a(n) = abs((n-1)*a(n-1) - n·a(n-2)), n > 2. A192264

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (0, 1, -1), (1, 0, 1), (1, 1, 0)}. A150537