Properties of the Number 47293

Forty-Seven Thousand Two Hundred Ninety-Three

Basics

Value: 47292 → 47293 → 47294

Parity: odd

Prime: Yes

Previous Prime: 47287

Next Prime: 47297

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 47293

Divisors: 1, 47293

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011100010111101

Octal: 134275

Duodecimal: 23451

Hexadecimal: b8bd

Square: 2236627849

Square Root: 217.46953809671828

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

Fubini numbers: number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements; or number of ordered partitions of [n]. A670

Exponential Riordan array [1, 1/(2-e^x)-1]. A256893

Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one or more components by one; square array A(n,k), n>=0, k>=0, read by antidiagonals. A262809

Triangle of numbers T(n,k) (n>=0, n>=k>=0) of transitive reflexive early confluent binary relations R on n labeled elements where k=max_x(|{y : xRy}|), read by rows. A135313

Number T(n,k) of endofunctions on [n] such that at least one preimage with cardinality >=k exists and a nonempty preimage of j implies that all i<=j have preimages with cardinality >=k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A245732

Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n). A94416

Number T(n,k) of compositions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A261781

Triangle read by rows, T(n, k) = binomial(n, k) * ∑_j=0..n-k E(n-k, j)*2^j, where E(n, k) are the Eulerian numbers A173018(n, k), for 0 <= k <= n. A154921

Array read by antidiagonals: T(n,k) = number of barred preferential arrangements of k things with n bars (k >=0, n >= 0). A226513

Number T(n,k) of ordered set partitions of [n] where k is minimal such that for each block b the smallest integer interval containing b has at most k elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A276891