Properties of the Number 48204

Forty-Eight Thousand Two Hundred Four

Basics

Value: 48203 → 48204 → 48205

Parity: even

Prime: No

Previous Prime: 48197

Next Prime: 48221

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 13 × 103

Divisors: 1, 2, 3, 4, 6, 9, 12, 13, 18, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1011110001001100

Octal: 136114

Duodecimal: 23A90

Hexadecimal: bc4c

Square: 2323625616

Square Root: 219.55409356238385

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 permutations that are 3 "block reversals" away from 12...n. A7975

4·a(n) is the maximum possible determinant of a 3 X 3 matrix whose entries are 9 consecutive primes starting with prime(n). A340923

Sums of 4 distinct powers of 6. A38480

Numbers n such that p(12n) is prime, where p(n) is the number of partitions of n. A115214

Expansion of 1/((1-z)*(1-2·z)*(1-3·z))³. A393588

Denominators of continued fraction convergents to sqrt(310). A41585

Numbers m such that σ(m)*τ(m) is a square but σ(m)/τ(m) is not an integer. A327831

Numbers k such that the sum of the divisors of k and the sum of the distinct prime divisors of k are both a square. A194196

Triangle (read by rows) of coefficients of the polynomials (in ascending order) of the denominators of the generalized sequence of fractions f(n) defined recursively by f(1) = m/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal. A225200

Triangle (read by rows) of coefficients of the polynomials (in ascending order) of the denominators of the generalized sequence s(n) of the sum resp. product of generalized fractions f(n) defined recursively by f(1) = m/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal. A225201