Properties of the Number -70631

Seventy Thousand Six Hundred Thirty-One

Basics

Value: -70632 → -70631 → -70630

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 11 × 6421

Divisors: 1, 11, 6421, 70631

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10001001111100111

Octal: -211747

Duodecimal: -34A5B

Hexadecimal: -113e7

Square: 4988738161

Square Root: 265.7649337290381

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

Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346426

Near-Bell numbers: partitions of an n-multiset with multiplicities 1, 1, 1, ..., 1, 2. A35098

Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros. A126442

Number of powerful uniform rooted trees with n nodes. A318689

Number of partitions of the (n+8)-multiset {0,...,0,1,2,...,8} with n 0's. A346861

Number of partitions of the (n+9)-multiset {1,2,...,n,1,2,...,9}. A346886

Diagonal element T(n,n) of the infinite array with T(n,1) = T(1,n) = Fibonacci(n) and recursively T(n,k) = T(n-1,k-1) + T(n,k-1) + T(n-1,k). A193913

For n >= 2, a(n) = a(n-1) + a(n-2) + A051697(n), a(0)=0, a(1)=1. A363707