Properties of the Number 15446

Fifteen Thousand Four Hundred Forty-Six

Basics

Value: 15445 → 15446 → 15447

Parity: even

Prime: No

Previous Prime: 15443

Next Prime: 15451

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 7723

Divisors: 1, 2, 7723, 15446

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110001010110

Octal: 36126

Duodecimal: 8B32

Hexadecimal: 3c56

Square: 238578916

Square Root: 124.28193754524428

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 partitions p of n not including ceiling(mean(p)) as a part. A241337

Divide the positive integers into subsets of lengths given by successive primes. a(n) is the sum of primes contained in the n-th subset. A344718

a(n) = sum(stirling1(n,k)²*k!, k=0..n). A192559

Number of 0..7 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 8. A200468

Number of 0..n arrays x(0..5) of 6 elements with each no smaller than the sum of its four previous neighbors modulo (n+1). A200470

a(n) = Sum_[k unrelated to n and k<n] a(k) = Sum_[k < n such that GCD(k,n) ≠ 1 and k does not divide n ] a(k); a(1) = a(2) = a(3) = a(4) = 1. A118657

Array read by ascending antidiagonals: A(n, k) = (-1)^{n + k} * ∑_j=0..k j! * Stirling1(n, j) * Stirling1(k, j). A379820

Generalized Fibonacci numbers: a(n) = a(n-1) + 10·a(n-2). A15446

T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo (k+1). A200469