Properties of the Number 49185

Forty-Nine Thousand One Hundred Eighty-Five

Basics

Value: 49184 → 49185 → 49186

Parity: odd

Prime: No

Previous Prime: 49177

Next Prime: 49193

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 1093

Divisors: 1, 3, 5, 9, 15, 45, 1093, 3279, 5465, 9837

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000000100001

Octal: 140041

Duodecimal: 24569

Hexadecimal: c021

Square: 2419164225

Square Root: 221.77691493931465

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 primitive subsequences of {1, 2, ..., n}. A51026

Growth series for affine Coxeter group (or affine Weyl group) D₄. A266759

Numbers k for which 2·k-1, 4·k-1, 8·k-1 and 16·k-1 are primes. A124494

Number of regions formed when n equally spaced points are placed around a circle and all pairs of points are joined by an interior arc whose radius equals the circle's radius. A371253

Fibonacci sequence beginning 13, 11. A206607

Numbers m such that m² divides 2^k - 1 for some k, 0 < k <= m. A246503

Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k UUDUDD's starting at level 0 (0 <= k <= floor(n/3); U=(1,1), D=(1,-1)). A166295

Number of Dyck paths of semilength n with no UUU's and no DDD's and having no UUDUDD's starting at level 0 (U=(1,1), D=(1,-1)). A166296

a(n) = a(floor(n/a(n-1))) + a(floor(n/a(n-2))) with a(1) = a(2) = 2. A283207

Revert transform of 2·x*(1 - x - x⁵ + x⁶)-x/(1+x). A49185