Properties of the Number 43681

Forty-Three Thousand Six Hundred Eighty-One

Basics

Value: 43680 → 43681 → 43682

Parity: odd

Prime: No

Previous Prime: 43669

Next Prime: 43691

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 ² × 19 ²

Divisors: 1, 11, 19, 121, 209, 361, 2299, 3971, 43681

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010101010100001

Octal: 125241

Duodecimal: 21341

Hexadecimal: aaa1

Square: 1908029761

Square Root: 209

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

a(n) = (1/3)*(n² + 2·n + 3)*(n+1)². A14820

a(n) = (6·n + 5)². A16970

T(n,k)=Number of nXk array permutations with each element moving zero or one space horizontally or diagonally. A189449

Member r=16 of the family of Chebyshev sequences S_r(n) defined in A092184. A98301

T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs. A258730

a(n) = n*(n+1)*(n+2)*(n+3)+1 = (n² + 3·n + 1)². A62938

a(n) = (8·n + 1)². A17078

Squares which are palindromes in base 13. A29999

Squares with initial digit '4'. A45787

T(n,k) is the number of arrays of n+2 elements from {0,1,...,k} with no two consecutive ascents. A200785