Properties of the Number 48692

Forty-Eight Thousand Six Hundred Ninety-Two

Basics

Value: 48691 → 48692 → 48693

Parity: even

Prime: No

Previous Prime: 48679

Next Prime: 48731

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 7 × 37 × 47

Divisors: 1, 2, 4, 7, 14, 28, 37, 47, 74, 94

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111000110100

Octal: 137064

Duodecimal: 24218

Hexadecimal: be34

Square: 2370910864

Square Root: 220.6626384325176

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

Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n. A92269

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum nonprime and every diagonal and antidiagonal sum prime. A251845

spt(7n+5) where spt(n) = A092269(n). A220502

a(n) = [ a(n-1)/a(1) ] + [ a(n-3)/a(3) ] + [ a(n-5)/a(5) ] + ..., for n >= 3. A22878

Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum nonprime and every diagonal and antidiagonal sum prime. A251841

Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum nonprime and every diagonal and antidiagonal sum prime. A251843

a(n) = 2·n³ - 3·n + 1. A377663

Expansion of e.g.f. (1 + x)*(1 + x²/2)*cosh(x). A388428

Triangle read by rows in which row n contains first n numbers with exactly n distinct prime factors. A48692