Properties of the Number -35253

Thirty-Five Thousand Two Hundred Fifty-Three

Basics

Value: -35254 → -35253 → -35252

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: Yes

Factorization: 3 ² × 3917

Divisors: 1, 3, 9, 3917, 11751, 35253

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000100110110101

Octal: -104665

Duodecimal: -18499

Hexadecimal: -89b5

Square: 1242774009

Square Root: 187.7578227398262

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

T(n,k) = number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2. A209115

Palindromes in A082939. A82940

Consecutive states of the linear congruential pseudo-random number generator (3661·s + 30809) mod 145800 when started at s=1. A385365

Period of 1/n in sequence A033938. A33939

Largest number that is not the sum of five n-gonal numbers. A118367

Number of 7-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2. A209119

Least k > 1 such that φ(k·n-1) = φ(k·n+1), or -1 if no such k exists. A276052

Least k such that φ(k·n-1) = φ(k·n+1), or -1 if no such k exists. A276373

Square array T(n,k), n >= 1, k >= 0, read by antidiagonals downwards, where T(n,k) = ∑_j=1..n (j·floor(n/j))^k. A356250

Start with 1 and repeatedly reverse the digits and add 38 to get the next term. A118634