Properties of the Number -47905

Forty-Seven Thousand Nine Hundred Five

Basics

Value: -47906 → -47905 → -47904

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 × 11 × 13 × 67

Divisors: 1, 5, 11, 13, 55, 65, 67, 143, 335, 715

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: Yes

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1011101100100001

Octal: -135441

Duodecimal: -23881

Hexadecimal: -bb21

Square: 2294889025

Square Root: 218.87210877587853

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) = 1² + 3² + 5² + 7² + ... + (2·n-1)² = n*(4·n² - 1)/3. A447

Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2ⁿ into powers of 2 less than or equal to 2^k. A152977

Odd tetrahedral numbers: a(n) = (4·n+1)*(4·n+2)*(4·n+3)/6. A15219

Triangle, read by rows, where T(n,k) = C( C(n+2,3) - C(k+2,3) + 3, n-k) for n>=k>=0. A126457

a(n) = binomial(prime(n+2), 3). A126995

Squarefree tetrahedral numbers. A70755

Greedy-summable tetrahedral numbers. A242291

Binomial coefficients C(67,n). A17783

Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2²^n into powers of 2 less than or equal to 2^k. A172288

Number of partitions of 2²^n into powers of 2 less than or equal to 2ⁿ. A182135