Properties of the Number -14541

Fourteen Thousand Five Hundred Forty-One

Basics

Value: -14542 → -14541 → -14540

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: Yes

Factorization: 3 × 37 × 131

Divisors: 1, 3, 37, 111, 131, 393, 4847, 14541

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11100011001101

Octal: -34315

Duodecimal: -84B9

Hexadecimal: -38cd

Square: 211440681

Square Root: 120.5860688471102

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 (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 2, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero. A253119

Expansion of e.g.f. 3 / (4 - 3·x - exp(3·x)). A355111

Smallest nontrivial palindromic multiple of the n-th palindrome (a(n) is not equal to the n-th palindrome). A83145

E.g.f.: Limit_N->oo [ ∑_n>=0 (N - n)^2·n * (x/N)ⁿ/n! ]^1/N. A266487

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 446", based on the 5-celled von Neumann neighborhood. A288338

Odd palindromes in which parity of digits alternates. A30148

Palindromic lucky numbers. A31161

Composite palindromes whose sum of prime factors is palindromic (counted with multiplicity). A46354

Smallest palindromic multiple of n-th palindrome which is not a concatenation of copies of that palindrome. A83146

Consider all (2n+1)-digit palindromic primes of the form 70...0M0...07 (so that M is a palindrome with <= 2n-1 digits); a(n) = smallest such M. A100956