Properties of the Number 15449

Fifteen Thousand Four Hundred Forty-Nine

Basics

Value: 15448 → 15449 → 15450

Parity: odd

Prime: No

Previous Prime: 15443

Next Prime: 15451

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 × 2207

Divisors: 1, 7, 2207, 15449

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11110001011001

Octal: 36131

Duodecimal: 8B35

Hexadecimal: 3c59

Square: 238671601

Square Root: 124.29400629153443

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

T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. A251428

Products of distinct terms of A001566: a(n) = ∏_{i=0..floor(log₂(n+1))} L(2ⁱ⁺¹)^bit(n,i). A50614

Products of distinct terms of 1 and rest from A001566: a(n) = ∏_{i=0..floor(log₂(n+1))} L(2ⁱ)^bit(n,i). A50613

Smallest k such that 2^2ⁿ - k is a safe prime. A181356

Number of partitions p of n such that median(p) >= mean(p). A240221

Odd composite integers m such that A004187(m-J(m,45)) == 0 (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol. A340099

a(n) = ∑_k=3..n binomial(k-1,2) * floor(n/k). A366970

Numerator of Sum[ Prime[k]², {k,1,n}] / Product[ Prime[k], {k,1,n}] = Numerator[ A024450[n] / A002110[n] ]. A122136

Number of n X 3 0..2 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A201272

a(0)=a(1)=1, a(n) = least k > a(n-1) such that k·a(n-2) is a Fibonacci number. A214914