Properties of the Number 67944

Sixty-Seven Thousand Nine Hundred Forty-Four

Basics

Value: 67943 → 67944 → 67945

Parity: even

Prime: No

Previous Prime: 67943

Next Prime: 67957

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 19 × 149

Divisors: 1, 2, 3, 4, 6, 8, 12, 19, 24, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000100101101000

Octal: 204550

Duodecimal: 333A0

Hexadecimal: 10968

Square: 4616387136

Square Root: 260.660698993922

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

T(n,k) = number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases. A205823

Number of (n+1) X 5 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases. A205819

Number of (n+1) X (n+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases. A205816

Number of broken 1-diamond partitions of n. A328539

L.g.f.: ∑_n>=1 a(n)*xⁿ/n = ∑_n>=1 xⁿ/n·exp( ∑_k>=1 a(n·k)*x^n·k/k ). A203253

G.f.: A(x) = exp( ∑_n>=1 G_n(xⁿ)*xⁿ/n ) such that G_n(xⁿ) = ∏_k=0..n-1 A(u^k*x) where u is an n-th root of unity. A203254

Integers of the form (rep(n)-1)/n where rep(n)=1111111111...111 with n 1's is the n-th repunit number. A67944