Properties of the Number -68303

Sixty-Eight Thousand Three Hundred Three

Basics

Value: -68304 → -68303 → -68302

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 167 × 409

Divisors: 1, 167, 409, 68303

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10000101011001111

Octal: -205317

Duodecimal: -3363B

Hexadecimal: -10acf

Square: 4665299809

Square Root: 261.34842643490316

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

Expansion of 1/(1 + x/(1 + x³/(1 + x⁴/(1 + x⁷/(1 + x¹¹/(1 + ... + x^Lucas(k)/(1 + ...))))))), a continued fraction. A294922

Triangle read by rows: T(n,m), n >= 0, 0 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}. A362925

Triangle read by rows: number of labeled partitions of n with maximin m. A113547

Triangle read by rows: T(n,m), n >= 1, 1 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}. A362924

Number of partitions of [2n] that have at most one block contained in [n]. A367820

A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct. A96772

Triangle read by rows: A113547 without its main diagonal. A362926

a(n) = ∑_k=0..n (k+1)⁵ * Stirling2(n,k). A383054

Partial sums of A032598. A129330