Properties of the Number 43691

Forty-Three Thousand Six Hundred Ninety-One

Basics

Value: 43690 → 43691 → 43692

Parity: odd

Prime: Yes

Previous Prime: 43669

Next Prime: 43711

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 43691

Divisors: 1, 43691

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010101010101011

Octal: 125253

Duodecimal: 2134B

Hexadecimal: aaab

Square: 1908903481

Square Root: 209.02392207591933

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

Jacobsthal sequence (or Jacobsthal numbers): a(n) = a(n-1) + 2·a(n-2), with a(0) = 0, a(1) = 1; also a(n) = nearest integer to 2ⁿ/3. A1045

a(n) = (2^{2·n + 1} + 1)/3. A7583

a(n) = C(n,2) + C(n,5) + ... + C(n, 3·floor(n/3)+2). A24495

a(2·n) = 2·a(2·n-1), a(2·n+1) = 2·a(2·n)-1. A5578

Expansion of 1/((1-x)*(1+2·x)). A77925

Cyclotomic polynomials at x=2. A19320

a(n) = C(n,0) + C(n,3) + ... + C(n,3[n/3]). A24493

Wagstaff primes: primes of form (2^p + 1)/3. A979

Zsigmondy numbers for a = 2, b = 1: Zs(n, 2, 1) is the greatest divisor of 2ⁿ - 1 (A000225) that is coprime to 2^m - 1 for all positive integers m < n. A64078

a(n) is the least prime such that the multiplicative order of 2 mod a(n) equals n, or a(n)=1 if no such prime exists. A112927