Properties of the Number 47908

Forty-Seven Thousand Nine Hundred Eight

Basics

Value: 47907 → 47908 → 47909

Parity: even

Prime: No

Previous Prime: 47903

Next Prime: 47911

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 7 × 29 × 59

Divisors: 1, 2, 4, 7, 14, 28, 29, 58, 59, 116

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101100100100

Octal: 135444

Duodecimal: 23884

Hexadecimal: bb24

Square: 2295176464

Square Root: 218.87896198584275

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

Number of line segments (or edges) in regular n-gon with all diagonals drawn. A135565

Numbers k such that k² divides 15^k-1. A128395

a(n) = ∑_{0 < x,y,z <= n and gcd(x² + y² + z², n)=1} gcd(x² + y² + z² - 1, n). A239612

Row sums of triangle A134392. A134393

Number of 4-cycles in the n X n black bishop graph. A289162

A unitary φ reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r·s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives r numbers. A80766

a(n) = n*(2·n² + 5·n + 3). A163815

15-gonal (or pentadecagonal) pyramidal numbers: a(n) = n*(n+1)*(13·n-10)/6. A177890

a(n) = ∑_k=0..n binomial(n+2·k+2,n-k) * Fibonacci(k+1). A390827

Number of segments (and sides) created by diagonals of an n-gon in general position. A14628