Properties of the Number 90641

Ninety Thousand Six Hundred Forty-One

Basics

Value: 90640 → 90641 → 90642

Parity: odd

Prime: Yes

Previous Prime: 90631

Next Prime: 90647

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 90641

Divisors: 1, 90641

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110001000010001

Octal: 261021

Duodecimal: 44555

Hexadecimal: 16211

Square: 8215790881

Square Root: 301.0664378505183

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 2nX2k 0..4 arrays with values 0..4 introduced in row major order and each element equal to exactly two horizontal and vertical neighbors. A198253

Partial sums of cuban primes A002407, that is, primes equal to the difference of two consecutive cubes. A221793

Primes of the form x² + 29*(x+1)². A176695

Number of 2n X 4 0..4 arrays with values 0..4 introduced in row major order and each element equal to exactly two horizontal and vertical neighbors. A198247

Primes p such that p + prime(p) is a square. A242625

Expansion of e.g.f.: exp(arcsin(sinh(x)))=1+x+1/2!*x²+3/3!*x³+9/4!*x⁴+41/5!*x⁵... A12099

sinh(arcsin(sinh(x)))=x+3/3!*x³+41/5!*x⁵+1403/7!*x⁷+90641/9!*x⁹... A12104

Number of 2nX12 0..4 arrays with values 0..4 introduced in row major order and each element equal to exactly two horizontal and vertical neighbors. A198251

Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack. A90641