Properties of the Number 10641

Ten Thousand Six Hundred Forty-One

Basics

Value: 10640 → 10641 → 10642

Parity: odd

Prime: No

Previous Prime: 10639

Next Prime: 10651

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 3547

Divisors: 1, 3, 3547, 10641

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100110010001

Octal: 24621

Duodecimal: 61A9

Hexadecimal: 2991

Square: 113230881

Square Root: 103.15522284402279

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

Number of integer partitions of n whose length and maximum both divide n. A326843

Expansion of g.f.: exp( ∑_n>=1 [∑_k=0..n C(n,k)^n-k+1 * x^k] * xⁿ/n ). A181080

a()=A037260 and its first [ A037261 ], 2nd [ A037262 ] and 3rd [ A037263 ] differences together include every number at most once and are monotonic and minimal. A37260

Number of n X 2 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 4,3,2,1,0 for x=0,1,2,3,4. A197211

Inverse Euler transform of {A001285(0), A001285(1), ...} where A001285(n) is Thue-Morse sequence. A29878

a(n) = 4·a(n-1) + a(n-2); a(0)=1, a(1)=8. A48877

a(n) = A064842(n)/2. A64843

a(n) = 7·n² + 14·n + 1. A131878

Indices k such that A019326(k)=φ[k](8) is prime, where φ is a cyclotomic polynomial. A138938

The 3-D toothpick sequence A160160, but using toothpicks of length 4; a(n) is the number of nodes occupied after n steps. A160430