Properties of the Number 48195

Forty-Eight Thousand One Hundred Ninety-Five

Basics

Value: 48194 → 48195 → 48196

Parity: odd

Prime: No

Previous Prime: 48193

Next Prime: 48197

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 5 × 7 × 17

Divisors: 1, 3, 5, 7, 9, 15, 17, 21, 27, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110001000011

Octal: 136103

Duodecimal: 23A83

Hexadecimal: bc43

Square: 2322758025

Square Root: 219.53359651770842

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

a(n) = n*(n + 1)*(7·n + 5)/6. A304993

Odd nonexponential abundant numbers: odd numbers k such that A160135(k) > k. A348605

G.f. A(x) satisfies A(x) = 1 + 9·x*A(x)^5/3. A385119

Least m such that n = m mod τ(m) if such m exists, otherwise 0. A66708

Odd bi-unitary admirable numbers: the odd terms of A334972. A334973

Odd numbers k such that A162296(k) > 2·k. A357607

a(n) is the least number k such that there are exactly n pairs (p,q) of primes with p<q such that p+q = 2·k and that 2·k+p, 2·k+q, p·q-2·k and p·q+2·k are primes. A354462

Expansion of e.g.f. arcsinh(log(x+1) - sin(x)). A13216

a(n) is the smallest integer k such that [1,2,...,k] contains a set of n but no more disjoint consecutive subsequences, each having element sum k. A378718

G.f. A(x) satisfies A(x)³ = 1 + 9·x*A(x)⁵. A245114