Properties of the Number 4446

Four Thousand Four Hundred Forty-Six

Basics

Value: 4445 → 4446 → 4447

Parity: even

Prime: No

Previous Prime: 4441

Next Prime: 4447

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 13 × 19

Divisors: 1, 2, 3, 6, 9, 13, 18, 19, 26, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000101011110

Octal: 10536

Duodecimal: 26A6

Hexadecimal: 115e

Square: 19766916

Square Root: 66.6783323126786

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

9-gonal (or enneagonal or nonagonal) numbers: a(n) = n*(7·n-5)/2. A1106

6 times triangular numbers: a(n) = 3·n*(n+1). A28896

Triangle S(n,k) by rows: coefficients of 6^(n-1/2)*(x^1/6*d/dx)ⁿ when n is odd, and of 6^n/2*(x^5/6*d/dx)ⁿ when n is even. A223172

Numbers in the cycle-attractors of length=14 of the function f(x)=A063919(x). A97030

Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3. A64238

T(n,k)=Number of nXk 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. A280480

Number of ways to write n as an ordered sum of 6 primes. A340962

Numbers that have exactly five prime factors counted with multiplicity (A014614) whose digit reversal is different and also has 5 prime factors (with multiplicity). A109025

Irregular triangle read by rows: row n (n>=1) lists the distinct areas of integer-sided triangles whose area equals n times their perimeter. A290451

A B₂ sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct. A10672