Properties of the Number 47088

Forty-Seven Thousand Eighty-Eight

Basics

Value: 47087 → 47088 → 47089

Parity: even

Prime: No

Previous Prime: 47087

Next Prime: 47093

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ³ × 109

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011011111110000

Octal: 133760

Duodecimal: 23300

Hexadecimal: b7f0

Square: 2217279744

Square Root: 216.9976958403015

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

Table read by rows: T(n,k) = number of k-gons, k >= 3, formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,m)/A006843(n,m), m = 1..A005728(n). A358889

Array T(n,k) counting words with n letters drawn from a k-letter alphabet with no letter appearing thrice in a 3-letter subword. A265584

Number of ternary words of length n with no 000's. A119826

Expansion of (1 + x + x²) / (1 - 3·x - 3·x²). A123620

Triangle read by rows: T(n,k) is the number of ternary sequences of length n containing k subsequences 000 (consecutively; n,k>=0). A119825

∑_k=0..n ((binomial(3·k,k)*binomial(2·n-k,n))/(2·k+1)). A270489

Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 - log(1+2·x)/2) ). A370936

Number of vertices of even degree in a cubic lattice n X n X n. A383585

Number of partitions of n into parts not of the form 19k, 19k+8 or 19k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 8 are greater than 1. A35977

Number of walks within N² (the first quadrant of Z²) starting at (0,0) and consisting of n steps taken from {(-1,-1), (-1,1), (-1,0), (0,1), (1,0), (1,1)}. A151322