Properties of the Number -34715

Thirty-Four Thousand Seven Hundred Fifteen

Basics

Value: -34716 → -34715 → -34714

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 53 × 131

Divisors: 1, 5, 53, 131, 265, 655, 6943, 34715

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000011110011011

Octal: -103633

Duodecimal: -1810B

Hexadecimal: -879b

Square: 1205131225

Square Root: 186.31961786135136

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

G.f.: ∑_n>=0 xⁿ * ∑_k=0..n binomial(n,k)² * x^k*(1-x)^n-k. A217615

Unimodal analog of Fibonacci numbers: a(n+1) = ∑_{k=0..floor(n/2)} A071922(n-k,k). A72176

G.f. A(x) satisfies: 1 = ∑_n>=0 ( (1 + x·A(x))ⁿ - A(x) )ⁿ. A303926

Numbers n with k divisors such that n-1 and n+1 in binary representation have same number k of 0's as 1's. A191369

Products p·q*r of three distinct primes such that (p·q) mod r, (p·r) mod q and (q·r) mod p are all prime. A338704

a(n) = ∑_k=0..n (-1)^n-k * binomial(n,k) * binomial(3·k,k). A383118

Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=4, I={0,2}. A79974

a(n) = floor(n^3/2)*floor(3+n^3/2)/2. A185593

a(n)=the sum of the (1,2)- and (1,3)-entries and twice the (1,4)-entry of the matrix Pⁿ + Tⁿ, where the 4 X 4 matrices P and T are defined by P=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,0] and T=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,1]. A109526

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, 0, 1), (1, 0, -1), (1, 1, 0)}. A150487