Properties of the Number 49970

Forty-Nine Thousand Nine Hundred Seventy

Basics

Value: 49969 → 49970 → 49971

Parity: even

Prime: No

Previous Prime: 49957

Next Prime: 49991

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 19 × 263

Divisors: 1, 2, 5, 10, 19, 38, 95, 190, 263, 526

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001100110010

Octal: 141462

Duodecimal: 24B02

Hexadecimal: c332

Square: 2497000900

Square Root: 223.53970564532824

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+1) = A154771(a(n)) = sum of all distinct "valid substrings" of a(n); a(1)=10 (least nontrivial choice). A154770

Numbers k such that k and k² use only the digits 0, 2, 4, 7 and 9. A136907

Number of binary strings of length n with no substrings equal to 0010 or 1100. A164405

Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 6 or 7 king-move adjacent elements, with upper left element zero. A305036

Fast "exotic addition" a o b = [ a[1]+b[1], a[1]*b[2]+a[2]*b[1] ]. A175841

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 2. A49970

Hilltop maps: number of 5Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 5Xn array. A219066