Properties of the Number -47047

Forty-Seven Thousand Forty-Seven

Basics

Value: -47048 → -47047 → -47046

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 7 × 11 × 13 × 47

Divisors: 1, 7, 11, 13, 47, 77, 91, 143, 329, 517

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011011111000111

Octal: -133707

Duodecimal: -23287

Hexadecimal: -b7c7

Square: 2213420209

Square Root: 216.90320421791836

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

a(n) = (n+1)*(n+2)*(n+3)*(n+4)*(5·n² + 19·n + 15)/360. A107963

Numbers n for which φ(n)=σ(n'), where φ is the Euler totient function, σ is the sum of divisors and n' the arithmetic derivative of n. A189057

Number of ordered set partitions of [n] with nondecreasing block sizes and maximal block size equal to ten. A272500

Terms of A349937 that are not divisible by 3: numbers k > 1 not divisible by 2 or 3 such that A309906(k-1) < A309906(k) > A309906(k+1). A349941

a(n) = ∑_{i=1..floor((n+1)/4)} a(2·i-1) * a(n-2·i+1), with a(1)=a(2)=1 and a(3)=7. A24733

Number of length n+2 0..3 arrays with at most one downstep in every n consecutive neighbor pairs. A258732

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes). A24603