Properties of the Number 43068

Forty-Three Thousand Sixty-Eight

Basics

Value: 43067 → 43068 → 43069

Parity: even

Prime: No

Previous Prime: 43067

Next Prime: 43093

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 37 × 97

Divisors: 1, 2, 3, 4, 6, 12, 37, 74, 97, 111

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010100000111100

Octal: 124074

Duodecimal: 20B10

Hexadecimal: a83c

Square: 1854852624

Square Root: 207.52831132161222

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) is the number of length n+1 0..2·k arrays with the sum of the absolute values of adjacent differences equal to n·k. A249982

Numbers m such that φ(m) = τ(m)³. A68559

G.f.: exp( ∑_n>=1 A163659(n²)*xⁿ/n ), where x·exp(∑_n>=1 A163659(n)*xⁿ/n) = S(x) is the g.f. of Stern's diatomic series (A002487). A195586

G.f. satisfies: A(x) = (1+x+x²)³ * A(x²)². A237650

Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k). A63968

a(n) = 3*(3·n+1)*(9·n+8)/2. A304504

a(n) = A153801(n)/2. A153804

Triangle read by rows: T(n,k) is the number of length n left factors of Dyck paths having k UUDD's, where U=(1,1) and D=(1,-1). A191793

Number of length n+1 0..2·3 arrays with the sum of the absolute values of adjacent differences equal to n·3. A249977

Number of length 6+1 0..2·n arrays with the sum of the absolute values of adjacent differences equal to 6·n. A249986