ℕ atory
Play Now

Properties of the Number 47685

Forty-Seven Thousand Six Hundred Eighty-Five

Basics

Value: 47684 → 47685 → 47686

Parity: odd

Prime: No

Previous Prime: 47681

Next Prime: 47699

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 11 × 17 2

Divisors: 1, 3, 5, 11, 15, 17, 33, 51, 55, 85

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101001000101

Octal: 135105

Duodecimal: 23719

Hexadecimal: ba45

Square: 2273859225

Square Root: 218.3689538373072

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 nXk 0..2 arrays with each element equal to either the sum mod 3 of its horizontal and vertical neighbors or the sum mod 3 of its diagonal and antidiagonal neighbors. A183526
Number of intersection points formed by drawing the line segments connecting any two lattice points of an n X m convex lattice polygon written as triangle T(n,m), n >= 1, 1 <= m <= n. A288180
G.f.: ∑k>=0 (1 + k·x)k * x3·k. A360707
Number of 1's in A127962(n). A127963
Triangle T, read by rows, where antidiagonal k of T = antidiagonal k-1 of Tk (after appending '1' for even k) for k>0, with T(n,n)=1 for n>=0. A132620
Number of n X 3 0..2 arrays with each element equal to either the sum mod 3 of its horizontal and vertical neighbors or the sum mod 3 of its diagonal and antidiagonal neighbors. A183520
Least index a(n) such that the sequences b(n,m) from A334539 are purely periodic after a(n). A335296
Number of nX7 0..2 arrays with each element equal to either the sum mod 3 of its horizontal and vertical neighbors or the sum mod 3 of its diagonal and antidiagonal neighbors. A183524
a(1) = 0, for primes p, a(p) = 1, and for any other number n, a(n) = max(A003415(n), A276086(n)). A328112
a(n) = n if n <= 3; for n > 3, a(n) is the closest number to a(n-2) that has not occurred earlier and has at least one common factor with a(n-2), but none with a(n-1). In case of a tie, choose the smaller. A340807