Properties of the Number 47376

Forty-Seven Thousand Three Hundred Seventy-Six

Basics

Value: 47375 → 47376 → 47377

Parity: even

Prime: No

Previous Prime: 47363

Next Prime: 47381

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 7 × 47

Divisors: 1, 2, 3, 4, 6, 7, 8, 9, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011100100010000

Octal: 134420

Duodecimal: 23500

Hexadecimal: b910

Square: 2244485376

Square Root: 217.66028576660466

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

Trajectory of 775 under the Reverse and Add! operation carried out in base 2, written in base 10. A77077

Number of n-step self-avoiding walks on a square lattice where no step can be in the same direction as the previous step. A337353

Number of permutations of order n avoiding the consecutive pattern 11'22'. A177470

a(n) = nⁿ + n!. A53042

E.g.f.: (1/(1-x⁶))*exp( 6*∑_i>=0 x^6·i+1/(6·i+1) ) for an order-6 linear recurrence with varying coefficients. A97681

a(n) = ∑_i=0..n (C(n,i) mod 2)*Fibonacci(2·i). A51656

Decimal representation of binary numbers with string structure 10s00, s in {0,1}*, such that it results in a non-palindromic cycle of length 4 in the Reverse and Add! procedure in base 2. A306514

a(0)=1, a(1)=1; for n>1, a(n) = the sum of the two largest earlier terms which are both coprime to n. A122456

The number of small Schröder paths such that the area between the path and the x-axis contains n up-triangles. A326793

E.g.f. satisfies A(x) = exp(x·A(x) * (1 + x·A(x))³). A365032