Properties of the Number 49225

Forty-Nine Thousand Two Hundred Twenty-Five

Basics

Value: 49224 → 49225 → 49226

Parity: odd

Prime: No

Previous Prime: 49223

Next Prime: 49253

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 ² × 11 × 179

Divisors: 1, 5, 11, 25, 55, 179, 275, 895, 1969, 4475

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000001001001

Octal: 140111

Duodecimal: 245A1

Hexadecimal: c049

Square: 2423100625

Square Root: 221.8670773233379

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

Antidiagonal sums of the convolution array A213576. A213578

T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A186486

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(∑_j>=1 j^k-1*A000041(j)*x^j). A293796

a(n) = smallest number with the property that the split-and-multiply technique (see A361338) in base n can produce all n single-digit numbers. A361340

Number of (n+1) X (n+1) 0..5 arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors. A186485

T(n,m)=Number of (n+1)X4 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A188058

Triangle read by rows in which T(n,k) is the number of length k chains from (0,0) to (n,n) of the poset [n] X [n] ordered by the product order, 0 <= k <= 2n, n>=0. A316649

Numbers k such that the sum of the numbers from 1 to k and that from 1 to k+1 share the same sum of divisors. A375819

Numbers k such that s(k) = s(k+2), where s(k) is the sum of odd divisors of k (A000593). A387920

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, 0, 0), (0, -1, 0), (0, 1, -1), (1, 0, 1)}. A148794