Properties of the Number 49196

Forty-Nine Thousand One Hundred Ninety-Six

Basics

Value: 49195 → 49196 → 49197

Parity: even

Prime: No

Previous Prime: 49193

Next Prime: 49199

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 7 ² × 251

Divisors: 1, 2, 4, 7, 14, 28, 49, 98, 196, 251

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000000101100

Octal: 140054

Duodecimal: 24578

Hexadecimal: c02c

Square: 2420246416

Square Root: 221.80171324856803

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 integer compositions of n whose leaders of strictly increasing runs are weakly increasing. A374690

Largest achievable determinant of a 3 X 3 matrix whose elements are 9 distinct nonnegative integers chosen from the range 0..n. A97401

Expansion of η(q⁴) * η(q²⁸) / (η(q) * η(q⁷)) in powers of q. A123648

Expansion of e.g.f. (1/x) * Series_Reversion( x * (1 - x·log(1-x)²) ). A392760

Numbers k such that usigma(k) = φ(k)*ω(k), where ω(k) is the number of distinct prime divisors of k. A63795

Number of subsets of {1,2,...,n-10} without differences equal to 2, 4, 6, 8 or 10. A224812

Numbers k such that A372692(k) = A372692(k+1) > 1. A372693

Convolution of Fibonacci F(n+1), n>=0, with F(n+4), n>=0. A67332

a(n) = ∑_k=0..n (k^k-k!). A68983

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 0, -1), (0, 1, -1), (1, 0, 1)}. A149374