Properties of the Number -14893

Fourteen Thousand Eight Hundred Ninety-Three

Basics

Value: -14894 → -14893 → -14892

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 53 × 281

Divisors: 1, 53, 281, 14893

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11101000101101

Octal: -35055

Duodecimal: -8751

Hexadecimal: -3a2d

Square: 221801449

Square Root: 122.03687967167957

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

Numbers k such that 2^k + 9 is prime. A57196

a(n) = ∑_k=0..6 binomial(n,k). A8859

a(n) = 2ⁿ - C(n,0)- ... - C(n,9). A35042

Indices of records in A194591 when it is restricted to odd indices. A194639

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0. A264257

a(n) = 2^2·n+1 - C(2·n+3,n+1) + C(2·n+1,n). A6419

Triangle read by rows: T(n,k) is the number of rooted planar maps with n edges, k faces and no isthmuses, n >= 0, k = 1..n+1. A342981

Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= ∑_j=0..n T(n-j,k-1)*binomial(2j+1,j+1). A90285

Sum of the fifth largest parts in the partitions of n into 7 parts. A308929

Number of + signs needed to write the partitions of n (A000041) as sums. A76276