Properties of the Number 48700

Forty-Eight Thousand Seven Hundred

Basics

Value: 48699 → 48700 → 48701

Parity: even

Prime: No

Previous Prime: 48679

Next Prime: 48731

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 5 ² × 487

Divisors: 1, 2, 4, 5, 10, 20, 25, 50, 100, 487

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111000111100

Octal: 137074

Duodecimal: 24224

Hexadecimal: be3c

Square: 2371690000

Square Root: 220.68076490713912

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

Numbers n such that sum of digits of n equals the sum of digits of n³. A70276

Restricted partitions. A49284

Numbers k such that A007953(k) >= A007953(k³), where A007953 = digital sum in base 10. A204324

a(n)=sqrt(A145848(n)). A146991

Numbers n which divide the periodic part (with zeros at end) of the decimal expansion of 1/n. A179267

Number of partitions of n in which exactly one odd part is repeated and even parts are unrestricted. A353903

Binary palindromes of odd length (written in base 10). A48700

Number of (n+1)X(4+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250588

Number of (4+1)X(n+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250636