Properties of the Number 94053

Ninety-Four Thousand Fifty-Three

Basics

Value: 94052 → 94053 → 94054

Parity: odd

Prime: No

Previous Prime: 94049

Next Prime: 94057

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 107 × 293

Divisors: 1, 3, 107, 293, 321, 879, 31351, 94053

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10110111101100101

Octal: 267545

Duodecimal: 46519

Hexadecimal: 16f65

Square: 8845966809

Square Root: 306.6806156247897

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

Expansion of ∏_k>=1 (1 + ((1 - sqrt(1 - 4·x))/2)^k). A307496

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), ...). A24481

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), F(4), ...). A25101

Triangle read by rows: T(n,k) = k*(n-k), 1 <= k <= n. A94053

Normalized number of connected (n+1)-state finite automata with 2 inputs. A6691

Number of labeled strongly connected n-state 2-input automata. A27834

T(n,k) = V(n,k)/k!, where V(n,k) = k^n·k - ∑_t=1..k-1 binomial(k,t)*k^n*(k-t)*V(n,t) for n, k >= 1; square array T read by upwards antidiagonals. A342202

Number of unlabeled strongly connected n-state 2-input automata. A27835