Properties of the Number -35105

Thirty-Five Thousand One Hundred Five

Basics

Value: -35106 → -35105 → -35104

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 7 × 17 × 59

Divisors: 1, 5, 7, 17, 35, 59, 85, 119, 295, 413

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000100100100001

Octal: -104441

Duodecimal: -18395

Hexadecimal: -8921

Square: 1232361025

Square Root: 187.36328348958875

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

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x². A367208

Numbers n such that 11n is a partition number. A225323

a(n) is the concatenation of n and 3n. A19551

a(n) = n*(n+1)*(5·n+7)/6. A162148

Second elementary symmetric function of 3,4,...,n+3. A24183

Number of 8k+3 primes (A007520) in range [2ⁿ,2ⁿ⁺¹]. A95010

Quasi-Carmichael numbers to base -7: squarefree composites n such that prime p∣n ==> p+7∣n+7. A29567

a(1) = 2, thereafter a(n) = ∑_k=1..n-1 floor(a(n-k)/k). A100483

Sum of the abscissae of the first returns to the horizontal axis (assumed to be 0 if there are no such returns) in all dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights). A191313

The least k such that the polynomial cyclotomic(k,x) has n different coefficients. A231611